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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 09:07:26,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 09:07:26,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 09:07:26,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 09:07:26,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 09:07:26,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 09:07:26,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 09:07:26,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 09:07:26,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 09:07:26,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 09:07:26,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 09:07:26,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 09:07:26,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 09:07:26,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 09:07:26,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 09:07:26,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 09:07:26,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 09:07:26,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 09:07:26,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 09:07:26,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 09:07:26,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 09:07:26,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 09:07:26,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 09:07:26,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 09:07:26,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 09:07:26,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 09:07:26,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 09:07:26,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 09:07:26,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 09:07:26,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 09:07:26,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 09:07:26,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 09:07:26,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 09:07:26,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 09:07:26,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 09:07:26,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 09:07:26,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 09:07:26,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 09:07:26,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 09:07:26,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 09:07:26,466 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 09:07:26,466 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 09:07:26,466 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 09:07:26,466 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 09:07:26,466 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 09:07:26,467 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 09:07:26,467 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 09:07:26,467 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 09:07:26,467 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 09:07:26,467 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 09:07:26,468 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 09:07:26,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 09:07:26,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 09:07:26,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 09:07:26,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 09:07:26,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 09:07:26,470 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 09:07:26,471 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 09:07:26,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 09:07:26,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 09:07:26,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 09:07:26,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 09:07:26,472 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 09:07:26,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 09:07:26,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 09:07:26,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 09:07:26,472 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 09:07:26,473 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 09:07:26,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 09:07:26,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 09:07:26,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 09:07:26,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 09:07:26,534 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 09:07:26,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28_true-unreach-call.c [2018-11-07 09:07:26,594 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0de73e7/4aa79cb9d27640299ef62edd78e3f66e/FLAG8d79bf062 [2018-11-07 09:07:27,245 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 09:07:27,246 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label28_true-unreach-call.c [2018-11-07 09:07:27,274 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0de73e7/4aa79cb9d27640299ef62edd78e3f66e/FLAG8d79bf062 [2018-11-07 09:07:27,293 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0de73e7/4aa79cb9d27640299ef62edd78e3f66e [2018-11-07 09:07:27,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 09:07:27,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 09:07:27,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 09:07:27,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 09:07:27,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 09:07:27,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:07:27" (1/1) ... [2018-11-07 09:07:27,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbdaad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:27, skipping insertion in model container [2018-11-07 09:07:27,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:07:27" (1/1) ... [2018-11-07 09:07:27,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 09:07:27,440 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 09:07:28,314 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:07:28,318 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 09:07:28,778 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:07:28,799 INFO L193 MainTranslator]: Completed translation [2018-11-07 09:07:28,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28 WrapperNode [2018-11-07 09:07:28,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 09:07:28,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 09:07:28,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 09:07:28,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 09:07:28,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 09:07:29,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 09:07:29,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 09:07:29,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 09:07:29,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (1/1) ... [2018-11-07 09:07:29,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 09:07:29,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 09:07:29,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 09:07:29,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 09:07:29,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (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-07 09:07:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 09:07:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 09:07:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 09:07:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 09:07:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 09:07:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 09:07:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 09:07:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 09:07:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 09:07:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 09:07:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 09:07:36,354 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 09:07:36,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:07:36 BoogieIcfgContainer [2018-11-07 09:07:36,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 09:07:36,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 09:07:36,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 09:07:36,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 09:07:36,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:07:27" (1/3) ... [2018-11-07 09:07:36,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686030dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:07:36, skipping insertion in model container [2018-11-07 09:07:36,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:07:28" (2/3) ... [2018-11-07 09:07:36,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686030dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:07:36, skipping insertion in model container [2018-11-07 09:07:36,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:07:36" (3/3) ... [2018-11-07 09:07:36,364 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label28_true-unreach-call.c [2018-11-07 09:07:36,374 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 09:07:36,383 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 09:07:36,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 09:07:36,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 09:07:36,436 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 09:07:36,436 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 09:07:36,436 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 09:07:36,436 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 09:07:36,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 09:07:36,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 09:07:36,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 09:07:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-07 09:07:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 09:07:36,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:07:36,480 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] [2018-11-07 09:07:36,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:07:36,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:07:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 339561401, now seen corresponding path program 1 times [2018-11-07 09:07:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:07:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:36,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:07:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:36,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:07:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:07:36,989 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 09:07:37,118 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-07 09:07:37,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:07:37,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:07:37,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:07:37,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:07:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:07:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:07:37,145 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-11-07 09:07:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:07:41,077 INFO L93 Difference]: Finished difference Result 1194 states and 2152 transitions. [2018-11-07 09:07:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:07:41,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-07 09:07:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:07:41,108 INFO L225 Difference]: With dead ends: 1194 [2018-11-07 09:07:41,108 INFO L226 Difference]: Without dead ends: 754 [2018-11-07 09:07:41,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:07:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-11-07 09:07:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-11-07 09:07:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-07 09:07:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1325 transitions. [2018-11-07 09:07:41,233 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1325 transitions. Word has length 39 [2018-11-07 09:07:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:07:41,234 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 1325 transitions. [2018-11-07 09:07:41,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:07:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1325 transitions. [2018-11-07 09:07:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 09:07:41,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:07:41,242 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:07:41,242 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:07:41,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:07:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1690148053, now seen corresponding path program 1 times [2018-11-07 09:07:41,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:07:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:07:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:41,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:07:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:07:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:07:41,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:07:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 09:07:41,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:07:41,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:07:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:07:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:07:41,602 INFO L87 Difference]: Start difference. First operand 752 states and 1325 transitions. Second operand 6 states. [2018-11-07 09:07:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:07:51,013 INFO L93 Difference]: Finished difference Result 2839 states and 5159 transitions. [2018-11-07 09:07:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 09:07:51,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-07 09:07:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:07:51,039 INFO L225 Difference]: With dead ends: 2839 [2018-11-07 09:07:51,039 INFO L226 Difference]: Without dead ends: 2093 [2018-11-07 09:07:51,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 09:07:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-11-07 09:07:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2052. [2018-11-07 09:07:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2018-11-07 09:07:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3398 transitions. [2018-11-07 09:07:51,165 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3398 transitions. Word has length 113 [2018-11-07 09:07:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:07:51,166 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 3398 transitions. [2018-11-07 09:07:51,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:07:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3398 transitions. [2018-11-07 09:07:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 09:07:51,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:07:51,180 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:07:51,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:07:51,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:07:51,181 INFO L82 PathProgramCache]: Analyzing trace with hash 55667084, now seen corresponding path program 1 times [2018-11-07 09:07:51,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:07:51,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:51,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:07:51,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:51,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:07:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:07:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:07:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:07:51,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 09:07:51,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:07:51,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 09:07:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 09:07:51,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 09:07:51,418 INFO L87 Difference]: Start difference. First operand 2052 states and 3398 transitions. Second operand 5 states. [2018-11-07 09:07:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:07:55,666 INFO L93 Difference]: Finished difference Result 6119 states and 10292 transitions. [2018-11-07 09:07:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 09:07:55,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-11-07 09:07:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:07:55,705 INFO L225 Difference]: With dead ends: 6119 [2018-11-07 09:07:55,706 INFO L226 Difference]: Without dead ends: 4073 [2018-11-07 09:07:55,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 09:07:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2018-11-07 09:07:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3992. [2018-11-07 09:07:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2018-11-07 09:07:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5866 transitions. [2018-11-07 09:07:55,843 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5866 transitions. Word has length 116 [2018-11-07 09:07:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:07:55,845 INFO L480 AbstractCegarLoop]: Abstraction has 3992 states and 5866 transitions. [2018-11-07 09:07:55,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 09:07:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5866 transitions. [2018-11-07 09:07:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 09:07:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:07:55,850 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:07:55,850 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:07:55,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:07:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1327529950, now seen corresponding path program 1 times [2018-11-07 09:07:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:07:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:55,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:07:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:07:55,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:07:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:07:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:07:56,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:07:56,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 09:07:56,086 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:07:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:07:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:07:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:07:56,088 INFO L87 Difference]: Start difference. First operand 3992 states and 5866 transitions. Second operand 6 states. [2018-11-07 09:08:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:08:00,711 INFO L93 Difference]: Finished difference Result 11063 states and 16902 transitions. [2018-11-07 09:08:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 09:08:00,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-07 09:08:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:08:00,760 INFO L225 Difference]: With dead ends: 11063 [2018-11-07 09:08:00,760 INFO L226 Difference]: Without dead ends: 7077 [2018-11-07 09:08:00,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:08:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2018-11-07 09:08:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 6975. [2018-11-07 09:08:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6975 states. [2018-11-07 09:08:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 9521 transitions. [2018-11-07 09:08:01,006 INFO L78 Accepts]: Start accepts. Automaton has 6975 states and 9521 transitions. Word has length 126 [2018-11-07 09:08:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:08:01,007 INFO L480 AbstractCegarLoop]: Abstraction has 6975 states and 9521 transitions. [2018-11-07 09:08:01,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:08:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6975 states and 9521 transitions. [2018-11-07 09:08:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 09:08:01,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:08:01,012 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:08:01,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:08:01,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:08:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1824244347, now seen corresponding path program 1 times [2018-11-07 09:08:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:08:01,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:08:01,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:08:01,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:08:01,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:08:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:08:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:08:01,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:08:01,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 09:08:01,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:08:01,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 09:08:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 09:08:01,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 09:08:01,375 INFO L87 Difference]: Start difference. First operand 6975 states and 9521 transitions. Second operand 5 states. [2018-11-07 09:08:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:08:08,825 INFO L93 Difference]: Finished difference Result 18643 states and 26318 transitions. [2018-11-07 09:08:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 09:08:08,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-07 09:08:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:08:08,887 INFO L225 Difference]: With dead ends: 18643 [2018-11-07 09:08:08,888 INFO L226 Difference]: Without dead ends: 11674 [2018-11-07 09:08:08,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 09:08:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11674 states. [2018-11-07 09:08:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11674 to 11528. [2018-11-07 09:08:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11528 states. [2018-11-07 09:08:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11528 states to 11528 states and 15522 transitions. [2018-11-07 09:08:09,239 INFO L78 Accepts]: Start accepts. Automaton has 11528 states and 15522 transitions. Word has length 136 [2018-11-07 09:08:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:08:09,240 INFO L480 AbstractCegarLoop]: Abstraction has 11528 states and 15522 transitions. [2018-11-07 09:08:09,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 09:08:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 11528 states and 15522 transitions. [2018-11-07 09:08:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 09:08:09,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:08:09,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:08:09,245 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:08:09,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:08:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 298084566, now seen corresponding path program 1 times [2018-11-07 09:08:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:08:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:08:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:08:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:08:09,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:08:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:08:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:08:09,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:08:09,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:08:09,856 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 09:08:09,858 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-07 09:08:09,916 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:08:09,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:08:10,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:08:10,469 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 09:08:10,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:08:10,510 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:08:10,890 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 77.92% of their original sizes. [2018-11-07 09:08:10,890 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:08:11,137 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 09:08:11,138 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:08:11,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:08:11,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-07 09:08:11,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:08:11,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:08:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:08:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:08:11,141 INFO L87 Difference]: Start difference. First operand 11528 states and 15522 transitions. Second operand 6 states. [2018-11-07 09:09:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:09:00,516 INFO L93 Difference]: Finished difference Result 23043 states and 31034 transitions. [2018-11-07 09:09:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 09:09:00,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-07 09:09:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:09:00,583 INFO L225 Difference]: With dead ends: 23043 [2018-11-07 09:09:00,583 INFO L226 Difference]: Without dead ends: 11521 [2018-11-07 09:09:00,619 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:09:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11521 states. [2018-11-07 09:09:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11521 to 11519. [2018-11-07 09:09:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11519 states. [2018-11-07 09:09:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 15480 transitions. [2018-11-07 09:09:00,897 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 15480 transitions. Word has length 151 [2018-11-07 09:09:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:09:00,898 INFO L480 AbstractCegarLoop]: Abstraction has 11519 states and 15480 transitions. [2018-11-07 09:09:00,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:09:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 15480 transitions. [2018-11-07 09:09:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 09:09:00,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:09:00,906 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 09:09:00,907 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:09:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:09:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1643772052, now seen corresponding path program 1 times [2018-11-07 09:09:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:09:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:09:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:00,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:09:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:09:02,012 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 09:09:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 158 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:09:02,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:09:02,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:09:02,381 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-11-07 09:09:02,381 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-07 09:09:02,391 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:09:02,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:09:02,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:09:02,607 INFO L272 AbstractInterpreter]: Visited 120 different actions 347 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 09:09:02,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:09:02,615 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:09:02,854 INFO L227 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 83.73% of their original sizes. [2018-11-07 09:09:02,854 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:09:02,958 INFO L415 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2018-11-07 09:09:02,959 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:09:02,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:09:02,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2018-11-07 09:09:02,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:09:02,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:09:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:09:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:09:02,961 INFO L87 Difference]: Start difference. First operand 11519 states and 15480 transitions. Second operand 9 states. [2018-11-07 09:09:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:09:40,081 INFO L93 Difference]: Finished difference Result 24221 states and 32454 transitions. [2018-11-07 09:09:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 09:09:40,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 247 [2018-11-07 09:09:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:09:40,125 INFO L225 Difference]: With dead ends: 24221 [2018-11-07 09:09:40,126 INFO L226 Difference]: Without dead ends: 13016 [2018-11-07 09:09:40,147 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-07 09:09:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13016 states. [2018-11-07 09:09:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13016 to 13009. [2018-11-07 09:09:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13009 states. [2018-11-07 09:09:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13009 states to 13009 states and 17070 transitions. [2018-11-07 09:09:40,391 INFO L78 Accepts]: Start accepts. Automaton has 13009 states and 17070 transitions. Word has length 247 [2018-11-07 09:09:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:09:40,392 INFO L480 AbstractCegarLoop]: Abstraction has 13009 states and 17070 transitions. [2018-11-07 09:09:40,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:09:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13009 states and 17070 transitions. [2018-11-07 09:09:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-07 09:09:40,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:09:40,400 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:09:40,400 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:09:40,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:09:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 851503085, now seen corresponding path program 1 times [2018-11-07 09:09:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:09:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:09:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:40,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:09:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:09:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-07 09:09:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:09:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:09:40,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:09:40,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:09:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:09:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:09:40,827 INFO L87 Difference]: Start difference. First operand 13009 states and 17070 transitions. Second operand 4 states. [2018-11-07 09:09:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:09:46,201 INFO L93 Difference]: Finished difference Result 41877 states and 58750 transitions. [2018-11-07 09:09:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:09:46,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-11-07 09:09:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:09:46,311 INFO L225 Difference]: With dead ends: 41877 [2018-11-07 09:09:46,311 INFO L226 Difference]: Without dead ends: 29182 [2018-11-07 09:09:46,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:09:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29182 states. [2018-11-07 09:09:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29182 to 29147. [2018-11-07 09:09:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29147 states. [2018-11-07 09:09:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29147 states to 29147 states and 36871 transitions. [2018-11-07 09:09:46,929 INFO L78 Accepts]: Start accepts. Automaton has 29147 states and 36871 transitions. Word has length 336 [2018-11-07 09:09:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:09:46,930 INFO L480 AbstractCegarLoop]: Abstraction has 29147 states and 36871 transitions. [2018-11-07 09:09:46,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:09:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29147 states and 36871 transitions. [2018-11-07 09:09:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-07 09:09:46,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:09:46,951 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:09:46,952 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:09:46,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:09:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 394036745, now seen corresponding path program 1 times [2018-11-07 09:09:46,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:09:46,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:46,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:09:46,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:09:46,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:09:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:09:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 35 proven. 135 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 09:09:47,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:09:47,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:09:47,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 427 with the following transitions: [2018-11-07 09:09:47,920 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-07 09:09:47,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:09:47,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:09:51,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:09:51,913 INFO L272 AbstractInterpreter]: Visited 284 different actions 846 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 09:09:51,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:09:51,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:09:51,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:09:51,923 INFO L194 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-07 09:09:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:09:51,938 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:09:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:09:52,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:09:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:09:52,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:09:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:09:52,920 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:09:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-11-07 09:09:52,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:09:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:09:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:09:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:09:52,922 INFO L87 Difference]: Start difference. First operand 29147 states and 36871 transitions. Second operand 3 states. [2018-11-07 09:09:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:09:58,823 INFO L93 Difference]: Finished difference Result 59296 states and 79006 transitions. [2018-11-07 09:09:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:09:58,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 426 [2018-11-07 09:09:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:09:59,009 INFO L225 Difference]: With dead ends: 59296 [2018-11-07 09:09:59,009 INFO L226 Difference]: Without dead ends: 33902 [2018-11-07 09:09:59,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:09:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33902 states. [2018-11-07 09:10:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33902 to 33896. [2018-11-07 09:10:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33896 states. [2018-11-07 09:10:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33896 states to 33896 states and 43884 transitions. [2018-11-07 09:10:00,200 INFO L78 Accepts]: Start accepts. Automaton has 33896 states and 43884 transitions. Word has length 426 [2018-11-07 09:10:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:10:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 33896 states and 43884 transitions. [2018-11-07 09:10:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:10:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 33896 states and 43884 transitions. [2018-11-07 09:10:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-07 09:10:00,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:10:00,233 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:10:00,234 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:10:00,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash -751627900, now seen corresponding path program 1 times [2018-11-07 09:10:00,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:10:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:00,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:10:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:00,704 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-11-07 09:10:00,916 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-11-07 09:10:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-11-07 09:10:01,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:10:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:10:01,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:10:01,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:10:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:10:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:10:01,047 INFO L87 Difference]: Start difference. First operand 33896 states and 43884 transitions. Second operand 4 states. [2018-11-07 09:10:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:10:06,213 INFO L93 Difference]: Finished difference Result 87170 states and 119619 transitions. [2018-11-07 09:10:06,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:10:06,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2018-11-07 09:10:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:10:06,472 INFO L225 Difference]: With dead ends: 87170 [2018-11-07 09:10:06,472 INFO L226 Difference]: Without dead ends: 53588 [2018-11-07 09:10:06,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:10:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53588 states. [2018-11-07 09:10:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53588 to 53378. [2018-11-07 09:10:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53378 states. [2018-11-07 09:10:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53378 states to 53378 states and 70289 transitions. [2018-11-07 09:10:07,648 INFO L78 Accepts]: Start accepts. Automaton has 53378 states and 70289 transitions. Word has length 472 [2018-11-07 09:10:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:10:07,649 INFO L480 AbstractCegarLoop]: Abstraction has 53378 states and 70289 transitions. [2018-11-07 09:10:07,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:10:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 53378 states and 70289 transitions. [2018-11-07 09:10:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-07 09:10:07,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:10:07,685 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:10:07,685 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:10:07,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 104952419, now seen corresponding path program 1 times [2018-11-07 09:10:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:10:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:07,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:10:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 09:10:08,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:10:08,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:10:08,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:10:08,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:10:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:10:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:10:08,109 INFO L87 Difference]: Start difference. First operand 53378 states and 70289 transitions. Second operand 3 states. [2018-11-07 09:10:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:10:12,214 INFO L93 Difference]: Finished difference Result 117116 states and 160582 transitions. [2018-11-07 09:10:12,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:10:12,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2018-11-07 09:10:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:10:12,481 INFO L225 Difference]: With dead ends: 117116 [2018-11-07 09:10:12,481 INFO L226 Difference]: Without dead ends: 54784 [2018-11-07 09:10:12,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:10:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54784 states. [2018-11-07 09:10:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54784 to 53993. [2018-11-07 09:10:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53993 states. [2018-11-07 09:10:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53993 states to 53993 states and 68536 transitions. [2018-11-07 09:10:13,694 INFO L78 Accepts]: Start accepts. Automaton has 53993 states and 68536 transitions. Word has length 484 [2018-11-07 09:10:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:10:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 53993 states and 68536 transitions. [2018-11-07 09:10:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:10:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53993 states and 68536 transitions. [2018-11-07 09:10:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-11-07 09:10:13,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:10:13,748 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:10:13,749 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:10:13,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 114734965, now seen corresponding path program 1 times [2018-11-07 09:10:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:10:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:13,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:10:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:15,006 WARN L179 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-07 09:10:15,453 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 09:10:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 332 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:10:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:10:16,276 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:10:16,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 553 with the following transitions: [2018-11-07 09:10:16,277 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1005], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-07 09:10:16,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:10:16,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:10:17,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:10:17,098 INFO L272 AbstractInterpreter]: Visited 285 different actions 1133 times. Merged at 8 different actions 28 times. Never widened. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 09:10:17,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:17,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:10:17,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:10:17,106 INFO L194 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-07 09:10:17,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:17,115 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:10:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:17,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:10:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 380 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 09:10:17,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:10:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 180 proven. 80 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 09:10:17,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:10:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-11-07 09:10:17,973 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:10:17,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 09:10:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 09:10:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-11-07 09:10:17,976 INFO L87 Difference]: Start difference. First operand 53993 states and 68536 transitions. Second operand 18 states. [2018-11-07 09:10:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:10:39,408 INFO L93 Difference]: Finished difference Result 147111 states and 197339 transitions. [2018-11-07 09:10:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 09:10:39,409 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 552 [2018-11-07 09:10:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:10:39,763 INFO L225 Difference]: With dead ends: 147111 [2018-11-07 09:10:39,763 INFO L226 Difference]: Without dead ends: 95105 [2018-11-07 09:10:39,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1116 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=974, Invalid=4576, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 09:10:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95105 states. [2018-11-07 09:10:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95105 to 89507. [2018-11-07 09:10:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89507 states. [2018-11-07 09:10:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89507 states to 89507 states and 110773 transitions. [2018-11-07 09:10:41,690 INFO L78 Accepts]: Start accepts. Automaton has 89507 states and 110773 transitions. Word has length 552 [2018-11-07 09:10:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:10:41,690 INFO L480 AbstractCegarLoop]: Abstraction has 89507 states and 110773 transitions. [2018-11-07 09:10:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 09:10:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 89507 states and 110773 transitions. [2018-11-07 09:10:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-11-07 09:10:41,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:10:41,737 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:10:41,737 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:10:41,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 337471277, now seen corresponding path program 1 times [2018-11-07 09:10:41,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:10:41,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:41,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:41,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:41,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:10:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:42,285 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-07 09:10:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-07 09:10:42,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:10:42,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:10:42,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:10:42,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:10:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:10:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:10:42,518 INFO L87 Difference]: Start difference. First operand 89507 states and 110773 transitions. Second operand 4 states. [2018-11-07 09:10:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:10:48,819 INFO L93 Difference]: Finished difference Result 195034 states and 245243 transitions. [2018-11-07 09:10:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:10:48,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 583 [2018-11-07 09:10:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:10:49,127 INFO L225 Difference]: With dead ends: 195034 [2018-11-07 09:10:49,128 INFO L226 Difference]: Without dead ends: 105841 [2018-11-07 09:10:49,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:10:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105841 states. [2018-11-07 09:10:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105841 to 103340. [2018-11-07 09:10:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103340 states. [2018-11-07 09:10:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103340 states to 103340 states and 127285 transitions. [2018-11-07 09:10:50,863 INFO L78 Accepts]: Start accepts. Automaton has 103340 states and 127285 transitions. Word has length 583 [2018-11-07 09:10:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:10:50,864 INFO L480 AbstractCegarLoop]: Abstraction has 103340 states and 127285 transitions. [2018-11-07 09:10:50,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:10:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 103340 states and 127285 transitions. [2018-11-07 09:10:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-11-07 09:10:50,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:10:50,944 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:10:50,944 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:10:50,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 996113612, now seen corresponding path program 1 times [2018-11-07 09:10:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:10:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:10:50,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:10:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 335 proven. 97 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-11-07 09:10:51,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:10:51,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:10:51,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 670 with the following transitions: [2018-11-07 09:10:51,631 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [699], [704], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [927], [932], [934], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-07 09:10:51,636 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:10:51,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:10:56,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:10:56,338 INFO L272 AbstractInterpreter]: Visited 290 different actions 861 times. Merged at 9 different actions 23 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 09:10:56,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:10:56,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:10:56,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:10:56,345 INFO L194 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-07 09:10:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:10:56,356 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Received shutdown request... [2018-11-07 09:10:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:10:56,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:10:56,591 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 09:10:56,792 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:10:56,793 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 09:10:56,799 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 09:10:56,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:10:56 BoogieIcfgContainer [2018-11-07 09:10:56,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 09:10:56,800 INFO L168 Benchmark]: Toolchain (without parser) took 209494.33 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,801 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-07 09:10:56,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1492.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 238.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,804 INFO L168 Benchmark]: Boogie Preprocessor took 161.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,805 INFO L168 Benchmark]: RCFGBuilder took 7153.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 304.8 MB). Peak memory consumption was 304.8 MB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,806 INFO L168 Benchmark]: TraceAbstraction took 200443.59 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 1.5 GB in the end (delta: 398.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-07 09:10:56,811 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 1492.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 238.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7153.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 304.8 MB). Peak memory consumption was 304.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200443.59 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 1.5 GB in the end (delta: 398.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 103). Cancelled while BasicCegarLoop was analyzing trace of length 670 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 200.3s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 167.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5223 SDtfs, 18638 SDslu, 3439 SDs, 0 SdLazy, 34364 SolverSat, 6132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 120.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2519 GetRequests, 2383 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103340occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.4s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9969664484452456 AbsIntWeakeningRatio, 0.11616161616161616 AbsIntAvgWeakeningVarsNumRemoved, 15.267676767676768 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9522 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 4759 NumberOfCodeBlocks, 4759 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5720 ConstructedInterpolants, 35 QuantifiedInterpolants, 8205517 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 3074/3408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown