java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:12:26,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:12:26,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:12:26,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:12:26,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:12:26,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:12:26,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:12:26,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:12:26,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:12:26,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:12:26,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:12:26,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:12:26,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:12:26,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:12:26,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:12:26,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:12:26,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:12:26,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:12:26,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:12:26,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:12:26,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:12:26,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:12:26,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:12:26,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:12:26,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:12:26,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:12:26,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:12:26,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:12:26,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:12:26,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:12:26,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:12:26,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:12:26,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:12:26,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:12:26,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:12:26,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:12:26,428 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 19:12:26,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:12:26,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:12:26,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:12:26,450 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:12:26,450 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:12:26,450 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:12:26,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:12:26,451 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:12:26,451 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:12:26,451 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:12:26,451 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:12:26,451 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:12:26,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:12:26,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:12:26,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:12:26,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:12:26,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:12:26,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:12:26,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:12:26,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:12:26,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:12:26,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:12:26,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:12:26,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:12:26,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:12:26,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:12:26,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:12:26,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:12:26,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:12:26,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:12:26,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:12:26,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:12:26,456 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:12:26,457 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:12:26,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:12:26,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:12:26,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:12:26,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:12:26,525 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:12:26,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-24 19:12:26,594 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1958ab0ca/6064456f05244fd78fadbdd2d6387608/FLAG0a5cb8116 [2018-10-24 19:12:27,213 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:12:27,216 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-24 19:12:27,234 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1958ab0ca/6064456f05244fd78fadbdd2d6387608/FLAG0a5cb8116 [2018-10-24 19:12:27,261 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1958ab0ca/6064456f05244fd78fadbdd2d6387608 [2018-10-24 19:12:27,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:12:27,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:12:27,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:12:27,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:12:27,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:12:27,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:27,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7904a4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27, skipping insertion in model container [2018-10-24 19:12:27,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:27,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:12:27,391 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:12:27,812 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:12:27,817 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:12:27,961 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:12:27,994 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:12:27,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27 WrapperNode [2018-10-24 19:12:27,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:12:27,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:12:27,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:12:27,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:12:28,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:12:28,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:12:28,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:12:28,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:12:28,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... [2018-10-24 19:12:28,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:12:28,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:12:28,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:12:28,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:12:28,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 19:12:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:12:28,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:12:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:12:28,367 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:12:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:12:28,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:12:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:12:28,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:12:32,120 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:12:32,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:32 BoogieIcfgContainer [2018-10-24 19:12:32,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:12:32,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:12:32,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:12:32,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:12:32,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:12:27" (1/3) ... [2018-10-24 19:12:32,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e26fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:32, skipping insertion in model container [2018-10-24 19:12:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:27" (2/3) ... [2018-10-24 19:12:32,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e26fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:32, skipping insertion in model container [2018-10-24 19:12:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:32" (3/3) ... [2018-10-24 19:12:32,130 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-10-24 19:12:32,141 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:12:32,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:12:32,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:12:32,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:12:32,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:12:32,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:12:32,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:12:32,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:12:32,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:12:32,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:12:32,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:12:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-24 19:12:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-24 19:12:32,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:32,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:12:32,263 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:32,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-10-24 19:12:32,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:32,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:32,861 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:12:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:33,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:33,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:12:33,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:33,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:12:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:12:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:12:33,056 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-24 19:12:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:35,076 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-24 19:12:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:12:35,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-24 19:12:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:35,102 INFO L225 Difference]: With dead ends: 550 [2018-10-24 19:12:35,103 INFO L226 Difference]: Without dead ends: 340 [2018-10-24 19:12:35,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:12:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-24 19:12:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-24 19:12:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-24 19:12:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-24 19:12:35,185 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-10-24 19:12:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:35,186 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-24 19:12:35,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:12:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-24 19:12:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 19:12:35,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:35,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:12:35,197 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:35,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-10-24 19:12:35,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:35,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:35,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:35,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:35,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:35,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:12:35,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:35,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:12:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:12:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:12:35,387 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-24 19:12:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:37,296 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-24 19:12:37,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:12:37,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-24 19:12:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:37,304 INFO L225 Difference]: With dead ends: 888 [2018-10-24 19:12:37,305 INFO L226 Difference]: Without dead ends: 554 [2018-10-24 19:12:37,310 INFO L605 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-10-24 19:12:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-24 19:12:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-24 19:12:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-24 19:12:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-24 19:12:37,354 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-10-24 19:12:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:37,355 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-24 19:12:37,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:12:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-24 19:12:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-24 19:12:37,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:37,361 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:12:37,361 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-10-24 19:12:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:37,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:37,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:37,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:12:37,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:37,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:12:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:12:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:12:37,875 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-24 19:12:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:39,649 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-24 19:12:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:12:39,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-24 19:12:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:39,657 INFO L225 Difference]: With dead ends: 1210 [2018-10-24 19:12:39,658 INFO L226 Difference]: Without dead ends: 536 [2018-10-24 19:12:39,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:12:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-24 19:12:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-24 19:12:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-24 19:12:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-24 19:12:39,716 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-10-24 19:12:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:39,716 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-24 19:12:39,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:12:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-24 19:12:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 19:12:39,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:39,720 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:12:39,722 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:39,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-10-24 19:12:39,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:39,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:39,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:39,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:39,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:40,150 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-24 19:12:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:40,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:12:40,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:40,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:12:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:12:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:12:40,241 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-24 19:12:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:42,552 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-24 19:12:42,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:12:42,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-24 19:12:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:42,557 INFO L225 Difference]: With dead ends: 1204 [2018-10-24 19:12:42,557 INFO L226 Difference]: Without dead ends: 535 [2018-10-24 19:12:42,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:12:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-24 19:12:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-24 19:12:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-24 19:12:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-24 19:12:42,578 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-10-24 19:12:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:42,579 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-24 19:12:42,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:12:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-24 19:12:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 19:12:42,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:42,582 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:12:42,582 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:42,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-10-24 19:12:42,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:42,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:42,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:42,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:12:42,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:42,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:12:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:12:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:12:42,730 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-24 19:12:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:43,571 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-24 19:12:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:12:43,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-24 19:12:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:43,585 INFO L225 Difference]: With dead ends: 1521 [2018-10-24 19:12:43,586 INFO L226 Difference]: Without dead ends: 992 [2018-10-24 19:12:43,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:12:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-24 19:12:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-24 19:12:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-24 19:12:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-24 19:12:43,632 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-10-24 19:12:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:43,632 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-24 19:12:43,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:12:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-24 19:12:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-24 19:12:43,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:43,638 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:12:43,638 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:43,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-10-24 19:12:43,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:43,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:43,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:12:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:12:43,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:43,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:12:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:12:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:12:43,792 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-24 19:12:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:12:44,843 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-24 19:12:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:12:44,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-24 19:12:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:12:44,857 INFO L225 Difference]: With dead ends: 2947 [2018-10-24 19:12:44,857 INFO L226 Difference]: Without dead ends: 1961 [2018-10-24 19:12:44,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:12:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-24 19:12:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-24 19:12:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-24 19:12:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-24 19:12:44,931 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-10-24 19:12:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:12:44,932 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-24 19:12:44,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:12:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-24 19:12:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 19:12:44,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:12:44,942 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 19:12:44,942 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:12:44,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-10-24 19:12:44,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:12:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:12:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:12:44,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:12:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:12:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:12:45,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:12:45,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:12:45,310 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-24 19:12:45,312 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 19:12:45,392 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:12:45,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:12:54,473 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:12:54,474 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-24 19:12:54,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:12:54,485 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:12:57,169 INFO L232 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 79.81% of their original sizes. [2018-10-24 19:12:57,169 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:12:58,621 INFO L413 sIntCurrentIteration]: We have 150 unified AI predicates [2018-10-24 19:12:58,621 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:12:58,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:12:58,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-24 19:12:58,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:12:58,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 19:12:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 19:12:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 19:12:58,624 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-10-24 19:13:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:13:10,778 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-10-24 19:13:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 19:13:10,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-10-24 19:13:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:13:10,788 INFO L225 Difference]: With dead ends: 3911 [2018-10-24 19:13:10,789 INFO L226 Difference]: Without dead ends: 1989 [2018-10-24 19:13:10,795 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-24 19:13:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-10-24 19:13:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-10-24 19:13:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-10-24 19:13:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-10-24 19:13:10,853 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-10-24 19:13:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:13:10,854 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-10-24 19:13:10,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 19:13:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-10-24 19:13:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 19:13:10,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:13:10,862 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 19:13:10,862 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:13:10,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:13:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-10-24 19:13:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:13:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:13:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:13:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:13:10,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:13:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:13:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 19:13:11,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:13:11,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:13:11,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-24 19:13:11,056 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 19:13:11,064 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:13:11,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:13:35,335 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:13:35,336 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 19:13:35,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:13:35,346 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:13:41,232 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 80.87% of their original sizes. [2018-10-24 19:13:41,233 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:15:20,692 INFO L413 sIntCurrentIteration]: We have 159 unified AI predicates [2018-10-24 19:15:20,693 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:15:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:15:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-24 19:15:20,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:15:20,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 19:15:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 19:15:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-10-24 19:15:20,695 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 19 states. Received shutdown request... [2018-10-24 19:16:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 19:16:49,280 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:16:49,287 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:16:49,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:16:49 BoogieIcfgContainer [2018-10-24 19:16:49,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:16:49,288 INFO L168 Benchmark]: Toolchain (without parser) took 262013.55 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2018-10-24 19:16:49,290 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:16:49,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 19:16:49,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 200.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 19:16:49,292 INFO L168 Benchmark]: Boogie Preprocessor took 73.69 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:16:49,292 INFO L168 Benchmark]: RCFGBuilder took 3850.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-10-24 19:16:49,293 INFO L168 Benchmark]: TraceAbstraction took 257165.22 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 626.0 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -581.6 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2018-10-24 19:16:49,298 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 200.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.69 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3850.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257165.22 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 626.0 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -581.6 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 503]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 503). Cancelled while BasicCegarLoop was constructing difference of abstraction (1989states) and FLOYD_HOARE automaton (currently 19 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (110 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 257.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 110.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 976 SDtfs, 3193 SDslu, 636 SDs, 0 SdLazy, 4198 SolverSat, 845 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 371 GetRequests, 257 SyntacticMatches, 49 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 119.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1989occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.4s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.994115745595737 AbsIntWeakeningRatio, 0.2459546925566343 AbsIntAvgWeakeningVarsNumRemoved, 1900.6019417475727 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 814335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 155/172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown