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_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:34:01,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:34:01,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:34:01,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:34:01,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:34:01,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:34:01,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:34:01,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:34:01,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:34:01,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:34:01,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:34:01,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:34:01,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:34:01,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:34:01,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:34:01,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:34:01,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:34:01,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:34:01,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:34:01,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:34:01,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:34:01,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:34:02,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:34:02,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:34:02,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:34:02,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:34:02,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:34:02,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:34:02,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:34:02,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:34:02,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:34:02,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:34:02,013 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:34:02,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:34:02,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:34:02,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:34:02,016 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:34:02,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:34:02,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:34:02,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:34:02,044 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:34:02,044 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:34:02,045 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:34:02,045 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:34:02,045 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:34:02,045 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:34:02,045 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:34:02,046 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:34:02,046 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:34:02,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:34:02,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:34:02,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:34:02,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:34:02,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:34:02,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:34:02,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:34:02,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:34:02,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:34:02,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:34:02,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:34:02,049 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:34:02,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:34:02,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:34:02,050 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:34:02,050 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:34:02,050 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:34:02,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:34:02,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:34:02,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:34:02,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:34:02,117 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:34:02,118 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-10-24 19:34:02,180 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc574124b/3c2d249177da4ab5a55c7f32ee6b57f7/FLAG2e1746d87 [2018-10-24 19:34:02,754 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:34:02,754 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-10-24 19:34:02,772 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc574124b/3c2d249177da4ab5a55c7f32ee6b57f7/FLAG2e1746d87 [2018-10-24 19:34:02,790 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc574124b/3c2d249177da4ab5a55c7f32ee6b57f7 [2018-10-24 19:34:02,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:34:02,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:34:02,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:34:02,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:34:02,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:34:02,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:02" (1/1) ... [2018-10-24 19:34:02,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79643315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:02, skipping insertion in model container [2018-10-24 19:34:02,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:02" (1/1) ... [2018-10-24 19:34:02,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:34:02,894 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:34:03,383 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:34:03,393 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:34:03,514 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:34:03,540 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:34:03,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03 WrapperNode [2018-10-24 19:34:03,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:34:03,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:34:03,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:34:03,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:34:03,551 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:34:03" (1/1) ... [2018-10-24 19:34:03,576 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:34:03" (1/1) ... [2018-10-24 19:34:03,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:34:03,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:34:03,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:34:03,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:34:03,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (1/1) ... [2018-10-24 19:34:03,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:34:03,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:34:03,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:34:03,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:34:03,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (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:34:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:34:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:34:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:34:03,954 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:34:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:34:03,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:34:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:34:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:34:07,368 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:34:07,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:07 BoogieIcfgContainer [2018-10-24 19:34:07,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:34:07,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:34:07,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:34:07,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:34:07,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:34:02" (1/3) ... [2018-10-24 19:34:07,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b35c92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:07, skipping insertion in model container [2018-10-24 19:34:07,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:03" (2/3) ... [2018-10-24 19:34:07,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b35c92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:07, skipping insertion in model container [2018-10-24 19:34:07,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:07" (3/3) ... [2018-10-24 19:34:07,382 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label53_true-unreach-call_false-termination.c [2018-10-24 19:34:07,392 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:34:07,406 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:34:07,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:34:07,478 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:34:07,478 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:34:07,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:34:07,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:34:07,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:34:07,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:34:07,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:34:07,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:34:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-24 19:34:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-24 19:34:07,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:07,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:07,529 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:07,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 151697799, now seen corresponding path program 1 times [2018-10-24 19:34:07,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:07,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:08,261 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:34:08,340 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:34:08,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:34:08,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:08,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:34:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:34:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:34:08,368 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-24 19:34:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:09,794 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-24 19:34:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:34:09,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-10-24 19:34:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:09,824 INFO L225 Difference]: With dead ends: 621 [2018-10-24 19:34:09,826 INFO L226 Difference]: Without dead ends: 382 [2018-10-24 19:34:09,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:34:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-24 19:34:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-24 19:34:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-24 19:34:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-24 19:34:09,913 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 145 [2018-10-24 19:34:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:09,915 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-24 19:34:09,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:34:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-24 19:34:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-24 19:34:09,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:09,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:09,924 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:09,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 627656218, now seen corresponding path program 1 times [2018-10-24 19:34:09,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:09,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:09,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:10,451 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:34:10,666 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 19:34:10,765 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-24 19:34:10,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:10,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:34:10,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:10,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:34:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:34:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:10,769 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-24 19:34:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:12,265 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-24 19:34:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:34:12,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2018-10-24 19:34:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:12,272 INFO L225 Difference]: With dead ends: 903 [2018-10-24 19:34:12,272 INFO L226 Difference]: Without dead ends: 381 [2018-10-24 19:34:12,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-24 19:34:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-24 19:34:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-24 19:34:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-24 19:34:12,300 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 154 [2018-10-24 19:34:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:12,300 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-24 19:34:12,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:34:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-24 19:34:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 19:34:12,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:12,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:12,306 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:12,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1014173274, now seen corresponding path program 1 times [2018-10-24 19:34:12,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:12,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:12,814 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-24 19:34:12,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:12,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:34:12,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:12,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:34:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:34:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:12,816 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-24 19:34:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:14,302 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-24 19:34:14,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:34:14,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-24 19:34:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:14,316 INFO L225 Difference]: With dead ends: 901 [2018-10-24 19:34:14,316 INFO L226 Difference]: Without dead ends: 380 [2018-10-24 19:34:14,319 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-24 19:34:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-24 19:34:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-24 19:34:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-24 19:34:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-24 19:34:14,339 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 160 [2018-10-24 19:34:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:14,339 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-24 19:34:14,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:34:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-24 19:34:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-24 19:34:14,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:14,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:14,343 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:14,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1544846205, now seen corresponding path program 1 times [2018-10-24 19:34:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:14,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:14,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:14,537 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-24 19:34:14,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:14,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:34:14,538 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:14,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:34:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:34:14,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:34:14,539 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-24 19:34:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:18,255 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-24 19:34:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:34:18,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-10-24 19:34:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:18,262 INFO L225 Difference]: With dead ends: 1193 [2018-10-24 19:34:18,262 INFO L226 Difference]: Without dead ends: 819 [2018-10-24 19:34:18,265 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-24 19:34:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-24 19:34:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-24 19:34:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-24 19:34:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-24 19:34:18,326 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 168 [2018-10-24 19:34:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:18,327 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-24 19:34:18,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:34:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-24 19:34:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 19:34:18,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:18,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:18,333 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:18,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -869251583, now seen corresponding path program 1 times [2018-10-24 19:34:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:18,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:18,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:18,730 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:34:18,972 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 19:34:19,065 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-24 19:34:19,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:19,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:34:19,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:19,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:34:19,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:34:19,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:19,067 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-24 19:34:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:20,274 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-24 19:34:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:34:20,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-10-24 19:34:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:20,287 INFO L225 Difference]: With dead ends: 1753 [2018-10-24 19:34:20,287 INFO L226 Difference]: Without dead ends: 804 [2018-10-24 19:34:20,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-24 19:34:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-24 19:34:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-24 19:34:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-24 19:34:20,329 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 170 [2018-10-24 19:34:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:20,329 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-24 19:34:20,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:34:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-24 19:34:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 19:34:20,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:20,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:20,334 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:20,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1524482181, now seen corresponding path program 1 times [2018-10-24 19:34:20,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:20,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:20,673 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-24 19:34:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:20,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:34:20,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:20,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:34:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:34:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:34:20,675 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-24 19:34:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:21,730 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-24 19:34:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:34:21,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-10-24 19:34:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:21,738 INFO L225 Difference]: With dead ends: 1747 [2018-10-24 19:34:21,738 INFO L226 Difference]: Without dead ends: 801 [2018-10-24 19:34:21,741 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-24 19:34:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-24 19:34:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-24 19:34:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-24 19:34:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-24 19:34:21,771 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 172 [2018-10-24 19:34:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:21,771 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-24 19:34:21,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:34:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-24 19:34:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 19:34:21,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:21,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:21,776 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:21,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash 406701453, now seen corresponding path program 1 times [2018-10-24 19:34:21,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:21,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:21,938 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-24 19:34:21,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:34:21,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:34:21,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:34:21,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:34:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:34:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:34:21,940 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-24 19:34:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:34:23,943 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-24 19:34:23,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:34:23,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-10-24 19:34:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:34:23,953 INFO L225 Difference]: With dead ends: 2381 [2018-10-24 19:34:23,954 INFO L226 Difference]: Without dead ends: 1586 [2018-10-24 19:34:23,958 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:34:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-24 19:34:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-24 19:34:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-24 19:34:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-24 19:34:24,004 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 176 [2018-10-24 19:34:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:34:24,004 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-24 19:34:24,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:34:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-24 19:34:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 19:34:24,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:34:24,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:34:24,012 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:34:24,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash 337466047, now seen corresponding path program 1 times [2018-10-24 19:34:24,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:34:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:34:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:34:24,014 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:34:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:34:24,458 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-24 19:34:24,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:34:24,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:34:24,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-24 19:34:24,462 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], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 19:34:24,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:34:24,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:35:01,631 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:35:01,632 INFO L272 AbstractInterpreter]: Visited 149 different actions 292 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 19:35:01,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:35:01,645 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:35:09,191 INFO L232 lantSequenceWeakener]: Weakened 86 states. On average, predicates are now at 82.66% of their original sizes. [2018-10-24 19:35:09,191 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:36:12,273 INFO L413 sIntCurrentIteration]: We have 210 unified AI predicates [2018-10-24 19:36:12,273 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:36:12,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:36:12,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-10-24 19:36:12,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:36:12,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 19:36:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 19:36:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-24 19:36:12,277 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 22 states. Received shutdown request... [2018-10-24 19:38:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 19:38:16,081 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:38:16,087 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:38:16,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:38:16 BoogieIcfgContainer [2018-10-24 19:38:16,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:38:16,088 INFO L168 Benchmark]: Toolchain (without parser) took 253283.95 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.5 GB in the end (delta: -122.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 19:38:16,090 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:38:16,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.57 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:38:16,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 208.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-24 19:38:16,092 INFO L168 Benchmark]: Boogie Preprocessor took 112.83 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:38:16,093 INFO L168 Benchmark]: RCFGBuilder took 3505.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2018-10-24 19:38:16,094 INFO L168 Benchmark]: TraceAbstraction took 248715.05 ms. Allocated memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 530.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 19:38:16,099 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 734.57 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 208.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.83 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 3505.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248715.05 ms. Allocated memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 530.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 22 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 248.6s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 136.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 908 SDtfs, 4515 SDslu, 710 SDs, 0 SdLazy, 5519 SolverSat, 1123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 272 GetRequests, 202 SyntacticMatches, 16 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 68.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 37.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.995590327169275 AbsIntWeakeningRatio, 0.15714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 341.1380952380952 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 1428036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown