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/Problem02_label12_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:47:08,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:47:08,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:47:08,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:47:08,404 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:47:08,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:47:08,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:47:08,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:47:08,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:47:08,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:47:08,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:47:08,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:47:08,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:47:08,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:47:08,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:47:08,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:47:08,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:47:08,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:47:08,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:47:08,444 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:47:08,445 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:47:08,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:47:08,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:47:08,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:47:08,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:47:08,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:47:08,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:47:08,452 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:47:08,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:47:08,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:47:08,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:47:08,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:47:08,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:47:08,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:47:08,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:47:08,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:47:08,462 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-27 00:47:08,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:47:08,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:47:08,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:47:08,492 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:47:08,492 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:47:08,493 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:47:08,493 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:47:08,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:47:08,493 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:47:08,493 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:47:08,494 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:47:08,494 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:47:08,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:47:08,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:47:08,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:47:08,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:47:08,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:47:08,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:47:08,496 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:47:08,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:47:08,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:47:08,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:47:08,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:47:08,497 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:47:08,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:47:08,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:47:08,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:47:08,498 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:47:08,498 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:47:08,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:47:08,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:47:08,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:47:08,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:47:08,583 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:47:08,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-10-27 00:47:08,655 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c7df104e/8516f78769be4d429919683f9c84d026/FLAG9148d118b [2018-10-27 00:47:09,262 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:47:09,263 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-10-27 00:47:09,275 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c7df104e/8516f78769be4d429919683f9c84d026/FLAG9148d118b [2018-10-27 00:47:09,291 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c7df104e/8516f78769be4d429919683f9c84d026 [2018-10-27 00:47:09,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:47:09,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:47:09,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:47:09,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:47:09,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:47:09,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:47:09" (1/1) ... [2018-10-27 00:47:09,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:09, skipping insertion in model container [2018-10-27 00:47:09,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:47:09" (1/1) ... [2018-10-27 00:47:09,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:47:09,389 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:47:09,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:47:09,807 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:47:09,981 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:47:10,000 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:47:10,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10 WrapperNode [2018-10-27 00:47:10,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:47:10,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:47:10,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:47:10,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:47:10,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:47:10,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:47:10,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:47:10,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:47:10,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (1/1) ... [2018-10-27 00:47:10,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:47:10,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:47:10,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:47:10,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:47:10,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (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-27 00:47:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:47:10,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:47:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:47:10,393 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:47:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:47:10,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:47:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:47:10,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:47:13,747 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:47:13,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:47:13 BoogieIcfgContainer [2018-10-27 00:47:13,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:47:13,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:47:13,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:47:13,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:47:13,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:47:09" (1/3) ... [2018-10-27 00:47:13,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:47:13, skipping insertion in model container [2018-10-27 00:47:13,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:47:10" (2/3) ... [2018-10-27 00:47:13,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:47:13, skipping insertion in model container [2018-10-27 00:47:13,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:47:13" (3/3) ... [2018-10-27 00:47:13,764 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label12_true-unreach-call_false-termination.c [2018-10-27 00:47:13,775 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:47:13,790 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:47:13,812 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:47:13,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:47:13,871 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:47:13,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:47:13,871 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:47:13,871 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:47:13,872 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:47:13,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:47:13,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:47:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 00:47:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 00:47:13,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:13,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:47:13,946 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:13,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash -426831369, now seen corresponding path program 1 times [2018-10-27 00:47:13,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:14,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:14,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:14,642 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:47:14,763 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-27 00:47:14,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:14,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:47:14,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:14,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:47:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:47:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:47:14,794 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 00:47:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:16,444 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 00:47:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:47:16,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-10-27 00:47:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:16,468 INFO L225 Difference]: With dead ends: 621 [2018-10-27 00:47:16,468 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 00:47:16,476 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-27 00:47:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 00:47:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 00:47:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 00:47:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 00:47:16,569 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 125 [2018-10-27 00:47:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:16,570 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 00:47:16,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:47:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 00:47:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 00:47:16,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:16,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:47:16,578 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:16,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 973432330, now seen corresponding path program 1 times [2018-10-27 00:47:16,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:16,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:16,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:17,070 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 00:47:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:17,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:47:17,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:17,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:47:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:47:17,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:17,168 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 00:47:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:19,096 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 00:47:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:47:19,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-27 00:47:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:19,102 INFO L225 Difference]: With dead ends: 903 [2018-10-27 00:47:19,103 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 00:47:19,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 00:47:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 00:47:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 00:47:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 00:47:19,156 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 134 [2018-10-27 00:47:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:19,157 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 00:47:19,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:47:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 00:47:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:47:19,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:19,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:47:19,160 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:19,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1888571286, now seen corresponding path program 1 times [2018-10-27 00:47:19,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:19,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:19,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:19,560 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-27 00:47:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:19,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:19,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:47:19,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:19,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:47:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:47:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:19,694 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 00:47:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:21,561 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 00:47:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:47:21,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-10-27 00:47:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:21,568 INFO L225 Difference]: With dead ends: 901 [2018-10-27 00:47:21,568 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 00:47:21,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 00:47:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 00:47:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 00:47:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 00:47:21,594 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 140 [2018-10-27 00:47:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:21,594 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 00:47:21,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:47:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 00:47:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:47:21,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:21,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:47:21,597 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:21,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -570889491, now seen corresponding path program 1 times [2018-10-27 00:47:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:21,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:21,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:47:21,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:21,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:47:21,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:47:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:47:21,880 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 00:47:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:25,082 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 00:47:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:47:25,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-27 00:47:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:25,089 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 00:47:25,089 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 00:47:25,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:47:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 00:47:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 00:47:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 00:47:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 00:47:25,129 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 148 [2018-10-27 00:47:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:25,129 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 00:47:25,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:47:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 00:47:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:47:25,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:25,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:47:25,134 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:25,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash -489152655, now seen corresponding path program 1 times [2018-10-27 00:47:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:25,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:25,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:25,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:47:25,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:25,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:47:25,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:47:25,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:25,362 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 00:47:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:26,469 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 00:47:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:47:26,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-10-27 00:47:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:26,481 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 00:47:26,481 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 00:47:26,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 00:47:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 00:47:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 00:47:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 00:47:26,511 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 150 [2018-10-27 00:47:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:26,512 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 00:47:26,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:47:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 00:47:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 00:47:26,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:26,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:47:26,516 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:26,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash -603913227, now seen corresponding path program 1 times [2018-10-27 00:47:26,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:26,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:26,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:26,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:26,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:26,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:47:26,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:26,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:47:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:47:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:26,887 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 00:47:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:27,823 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 00:47:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:47:27,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-10-27 00:47:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:27,832 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 00:47:27,833 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 00:47:27,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:47:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 00:47:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 00:47:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 00:47:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 00:47:27,905 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 152 [2018-10-27 00:47:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:27,905 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 00:47:27,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:47:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 00:47:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 00:47:27,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:27,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:47:27,910 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:27,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash 931126525, now seen corresponding path program 1 times [2018-10-27 00:47:27,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:27,913 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:47:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:47:28,115 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:47:28,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:47:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:47:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:47:28,117 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 00:47:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:47:30,315 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 00:47:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:47:30,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-27 00:47:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:47:30,329 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 00:47:30,329 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 00:47:30,334 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-27 00:47:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 00:47:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 00:47:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 00:47:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 00:47:30,383 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 156 [2018-10-27 00:47:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:47:30,384 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 00:47:30,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:47:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 00:47:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 00:47:30,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:47:30,390 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:47:30,390 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:47:30,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:47:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1732925114, now seen corresponding path program 1 times [2018-10-27 00:47:30,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:47:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:30,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:47:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:47:30,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:47:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:30,653 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:47:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:47:30,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:47:30,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-10-27 00:47:30,725 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 00:47:30,809 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:47:30,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:48:20,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 00:48:20,656 INFO L272 AbstractInterpreter]: Visited 130 different actions 384 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 00:48:20,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:48:20,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 00:48:20,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:48:20,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 00:48:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:48:20,682 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 00:48:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:20,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:48:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:48:21,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:48:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:48:21,496 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:48:21,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-10-27 00:48:21,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:48:21,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:48:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:48:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:48:21,499 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-10-27 00:48:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:48:23,760 INFO L93 Difference]: Finished difference Result 3798 states and 5500 transitions. [2018-10-27 00:48:23,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:48:23,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-27 00:48:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:48:23,776 INFO L225 Difference]: With dead ends: 3798 [2018-10-27 00:48:23,776 INFO L226 Difference]: Without dead ends: 2246 [2018-10-27 00:48:23,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:48:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-10-27 00:48:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-10-27 00:48:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-27 00:48:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3096 transitions. [2018-10-27 00:48:23,858 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3096 transitions. Word has length 162 [2018-10-27 00:48:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:48:23,859 INFO L481 AbstractCegarLoop]: Abstraction has 2246 states and 3096 transitions. [2018-10-27 00:48:23,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:48:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3096 transitions. [2018-10-27 00:48:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 00:48:23,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:48:23,870 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, 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] [2018-10-27 00:48:23,870 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:48:23,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:48:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash 30439215, now seen corresponding path program 1 times [2018-10-27 00:48:23,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:48:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:48:23,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:48:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:48:23,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:48:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:48:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:48:24,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:48:24,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-10-27 00:48:24,346 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 00:48:24,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:48:24,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:48:52,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:48:52,010 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 00:48:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:48:52,016 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:49:02,200 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 82.45% of their original sizes. [2018-10-27 00:49:02,201 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:50:09,001 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-10-27 00:50:09,001 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:50:09,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:50:09,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-10-27 00:50:09,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:50:09,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 00:50:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 00:50:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-27 00:50:09,004 INFO L87 Difference]: Start difference. First operand 2246 states and 3096 transitions. Second operand 22 states. Received shutdown request... [2018-10-27 00:51:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:51:20,853 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 00:51:20,860 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 00:51:20,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:51:20 BoogieIcfgContainer [2018-10-27 00:51:20,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:51:20,862 INFO L168 Benchmark]: Toolchain (without parser) took 251559.22 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -385.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-27 00:51:20,863 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-10-27 00:51:20,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.75 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-27 00:51:20,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 209.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:51:20,866 INFO L168 Benchmark]: Boogie Preprocessor took 103.23 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-10-27 00:51:20,867 INFO L168 Benchmark]: RCFGBuilder took 3432.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-10-27 00:51:20,868 INFO L168 Benchmark]: TraceAbstraction took 247112.25 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 293.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-27 00:51:20,873 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 695.75 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 209.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.23 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3432.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247112.25 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 293.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 526]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 526). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 21 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (429 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 247.0s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 87.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1228 SDtfs, 4501 SDslu, 788 SDs, 0 SdLazy, 5828 SolverSat, 1215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 587 GetRequests, 506 SyntacticMatches, 19 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 71.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2246occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 77.6s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9951261510818301 AbsIntWeakeningRatio, 0.1736842105263158 AbsIntAvgWeakeningVarsNumRemoved, 390.32105263157894 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1520 NumberOfCodeBlocks, 1520 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1671 ConstructedInterpolants, 0 QuantifiedInterpolants, 1447591 SizeOfPredicates, 2 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 312/338 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown