java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 09:02:03,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 09:02:03,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 09:02:03,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 09:02:03,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 09:02:03,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 09:02:03,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 09:02:03,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 09:02:03,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 09:02:03,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 09:02:03,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 09:02:03,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 09:02:03,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 09:02:03,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 09:02:03,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 09:02:03,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 09:02:03,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 09:02:03,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 09:02:03,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 09:02:03,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 09:02:03,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 09:02:03,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 09:02:03,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 09:02:03,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 09:02:03,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 09:02:03,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 09:02:03,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 09:02:03,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 09:02:03,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 09:02:03,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 09:02:03,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 09:02:03,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 09:02:03,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 09:02:03,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 09:02:03,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 09:02:03,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 09:02:03,852 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 09:02:03,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 09:02:03,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 09:02:03,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 09:02:03,870 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 09:02:03,870 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 09:02:03,870 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 09:02:03,871 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 09:02:03,871 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 09:02:03,871 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 09:02:03,871 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 09:02:03,871 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 09:02:03,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 09:02:03,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 09:02:03,872 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 09:02:03,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 09:02:03,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 09:02:03,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 09:02:03,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 09:02:03,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 09:02:03,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 09:02:03,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 09:02:03,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 09:02:03,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 09:02:03,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 09:02:03,877 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 09:02:03,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 09:02:03,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 09:02:03,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 09:02:03,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 09:02:03,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 09:02:03,879 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 09:02:03,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 09:02:03,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 09:02:03,880 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 09:02:03,880 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 09:02:03,880 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 09:02:03,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 09:02:03,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 09:02:03,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 09:02:03,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 09:02:03,955 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 09:02:03,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 09:02:04,032 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7411c377a/f1433c00673c4fe7a01e33074b601f3f/FLAGa800a5e2d [2018-11-07 09:02:04,637 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 09:02:04,638 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 09:02:04,657 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7411c377a/f1433c00673c4fe7a01e33074b601f3f/FLAGa800a5e2d [2018-11-07 09:02:04,680 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7411c377a/f1433c00673c4fe7a01e33074b601f3f [2018-11-07 09:02:04,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 09:02:04,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 09:02:04,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 09:02:04,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 09:02:04,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 09:02:04,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:02:04" (1/1) ... [2018-11-07 09:02:04,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ddd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:04, skipping insertion in model container [2018-11-07 09:02:04,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:02:04" (1/1) ... [2018-11-07 09:02:04,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 09:02:04,810 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 09:02:05,297 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:02:05,302 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 09:02:05,502 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:02:05,520 INFO L193 MainTranslator]: Completed translation [2018-11-07 09:02:05,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05 WrapperNode [2018-11-07 09:02:05,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 09:02:05,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 09:02:05,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 09:02:05,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 09:02:05,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 09:02:05,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 09:02:05,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 09:02:05,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 09:02:05,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... [2018-11-07 09:02:05,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 09:02:05,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 09:02:05,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 09:02:05,798 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 09:02:05,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 09:02:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 09:02:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 09:02:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 09:02:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 09:02:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 09:02:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 09:02:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 09:02:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 09:02:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 09:02:09,436 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 09:02:09,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:02:09 BoogieIcfgContainer [2018-11-07 09:02:09,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 09:02:09,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 09:02:09,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 09:02:09,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 09:02:09,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:02:04" (1/3) ... [2018-11-07 09:02:09,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362e72d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:02:09, skipping insertion in model container [2018-11-07 09:02:09,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:05" (2/3) ... [2018-11-07 09:02:09,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362e72d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:02:09, skipping insertion in model container [2018-11-07 09:02:09,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:02:09" (3/3) ... [2018-11-07 09:02:09,446 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 09:02:09,457 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 09:02:09,466 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 09:02:09,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 09:02:09,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 09:02:09,534 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 09:02:09,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 09:02:09,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 09:02:09,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 09:02:09,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 09:02:09,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 09:02:09,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 09:02:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 09:02:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 09:02:09,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:02:09,571 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] [2018-11-07 09:02:09,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:02:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash -50157732, now seen corresponding path program 1 times [2018-11-07 09:02:09,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:02:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:02:09,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:09,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:02:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:02:10,003 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 09:02:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:02:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:02:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:02:10,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:02:10,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:02:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:02:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:02:10,073 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 09:02:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:02:11,654 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 09:02:11,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:02:11,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-07 09:02:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:02:11,676 INFO L225 Difference]: With dead ends: 691 [2018-11-07 09:02:11,677 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 09:02:11,686 INFO L604 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-11-07 09:02:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 09:02:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 09:02:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 09:02:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 09:02:11,784 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 44 [2018-11-07 09:02:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:02:11,785 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 09:02:11,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:02:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 09:02:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 09:02:11,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:02:11,794 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 09:02:11,795 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:02:11,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1724157031, now seen corresponding path program 1 times [2018-11-07 09:02:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:02:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:02:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:11,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:02:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:02:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:02:12,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:02:12,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 09:02:12,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:02:12,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:02:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:02:12,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:02:12,212 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 09:02:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:02:14,194 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-11-07 09:02:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 09:02:14,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-07 09:02:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:02:14,202 INFO L225 Difference]: With dead ends: 1062 [2018-11-07 09:02:14,202 INFO L226 Difference]: Without dead ends: 634 [2018-11-07 09:02:14,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:02:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-07 09:02:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-11-07 09:02:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-07 09:02:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-11-07 09:02:14,247 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 131 [2018-11-07 09:02:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:02:14,248 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-11-07 09:02:14,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:02:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-11-07 09:02:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 09:02:14,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:02:14,253 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 09:02:14,253 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:02:14,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:14,254 INFO L82 PathProgramCache]: Analyzing trace with hash 415093804, now seen corresponding path program 1 times [2018-11-07 09:02:14,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:02:14,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:02:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:14,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:02:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:02:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:02:14,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:02:14,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:02:14,515 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:02:14,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:02:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:02:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:02:14,517 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-11-07 09:02:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:02:18,096 INFO L93 Difference]: Finished difference Result 2352 states and 4010 transitions. [2018-11-07 09:02:18,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:02:18,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-07 09:02:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:02:18,118 INFO L225 Difference]: With dead ends: 2352 [2018-11-07 09:02:18,118 INFO L226 Difference]: Without dead ends: 1733 [2018-11-07 09:02:18,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:02:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-11-07 09:02:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2018-11-07 09:02:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2018-11-07 09:02:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2668 transitions. [2018-11-07 09:02:18,196 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2668 transitions. Word has length 140 [2018-11-07 09:02:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:02:18,197 INFO L480 AbstractCegarLoop]: Abstraction has 1733 states and 2668 transitions. [2018-11-07 09:02:18,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:02:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2668 transitions. [2018-11-07 09:02:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-07 09:02:18,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:02:18,211 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:02:18,212 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:02:18,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -872463117, now seen corresponding path program 1 times [2018-11-07 09:02:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:02:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:18,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:02:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:18,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:02:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:02:18,841 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-07 09:02:19,097 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-07 09:02:19,431 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-07 09:02:19,573 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-11-07 09:02:19,723 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2018-11-07 09:02:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 147 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:02:20,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:02:20,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:02:20,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-07 09:02:20,005 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:02:20,057 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:02:20,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:02:24,531 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:02:24,533 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 09:02:24,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:24,578 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:02:27,655 INFO L227 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 77.74% of their original sizes. [2018-11-07 09:02:27,655 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:02:27,927 INFO L415 sIntCurrentIteration]: We unified 276 AI predicates to 276 [2018-11-07 09:02:27,929 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:02:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:02:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2018-11-07 09:02:27,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:02:27,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:02:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:02:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:02:27,932 INFO L87 Difference]: Start difference. First operand 1733 states and 2668 transitions. Second operand 6 states. [2018-11-07 09:02:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:02:45,084 INFO L93 Difference]: Finished difference Result 3645 states and 5630 transitions. [2018-11-07 09:02:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 09:02:45,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 277 [2018-11-07 09:02:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:02:45,096 INFO L225 Difference]: With dead ends: 3645 [2018-11-07 09:02:45,096 INFO L226 Difference]: Without dead ends: 1918 [2018-11-07 09:02:45,106 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:02:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2018-11-07 09:02:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1916. [2018-11-07 09:02:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-11-07 09:02:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2859 transitions. [2018-11-07 09:02:45,163 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2859 transitions. Word has length 277 [2018-11-07 09:02:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:02:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 1916 states and 2859 transitions. [2018-11-07 09:02:45,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:02:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2859 transitions. [2018-11-07 09:02:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-07 09:02:45,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:02:45,175 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-11-07 09:02:45,176 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:02:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash 594401252, now seen corresponding path program 1 times [2018-11-07 09:02:45,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:02:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:45,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:02:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:02:45,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:02:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:02:45,709 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 09:02:45,893 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 09:02:46,119 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 09:02:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 199 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:02:46,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:02:46,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:02:46,622 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2018-11-07 09:02:46,623 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:02:46,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:02:46,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:02:50,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:02:50,505 INFO L272 AbstractInterpreter]: Visited 129 different actions 251 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 09:02:50,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:02:50,511 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:02:52,681 INFO L227 lantSequenceWeakener]: Weakened 359 states. On average, predicates are now at 77.7% of their original sizes. [2018-11-07 09:02:52,681 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:02:53,233 INFO L415 sIntCurrentIteration]: We unified 361 AI predicates to 361 [2018-11-07 09:02:53,233 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:02:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:02:53,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-07 09:02:53,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:02:53,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 09:02:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 09:02:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 09:02:53,235 INFO L87 Difference]: Start difference. First operand 1916 states and 2859 transitions. Second operand 10 states. [2018-11-07 09:03:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:03:47,671 INFO L93 Difference]: Finished difference Result 4389 states and 6507 transitions. [2018-11-07 09:03:47,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 09:03:47,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 362 [2018-11-07 09:03:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:03:47,683 INFO L225 Difference]: With dead ends: 4389 [2018-11-07 09:03:47,683 INFO L226 Difference]: Without dead ends: 2292 [2018-11-07 09:03:47,694 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:03:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2018-11-07 09:03:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2290. [2018-11-07 09:03:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2018-11-07 09:03:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3256 transitions. [2018-11-07 09:03:47,754 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3256 transitions. Word has length 362 [2018-11-07 09:03:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:03:47,755 INFO L480 AbstractCegarLoop]: Abstraction has 2290 states and 3256 transitions. [2018-11-07 09:03:47,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:03:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3256 transitions. [2018-11-07 09:03:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-11-07 09:03:47,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:03:47,770 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:03:47,771 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:03:47,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:03:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 363296860, now seen corresponding path program 1 times [2018-11-07 09:03:47,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:03:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:03:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:03:47,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:03:47,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:03:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:03:48,987 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 09:03:49,462 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 09:03:49,815 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-07 09:03:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 346 proven. 250 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:03:50,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:03:50,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:03:50,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 463 with the following transitions: [2018-11-07 09:03:50,388 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:03:50,393 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:03:50,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:03:54,146 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:03:54,146 INFO L272 AbstractInterpreter]: Visited 130 different actions 254 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 09:03:54,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:03:54,156 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:03:56,247 INFO L227 lantSequenceWeakener]: Weakened 459 states. On average, predicates are now at 77.64% of their original sizes. [2018-11-07 09:03:56,247 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:03:56,330 INFO L415 sIntCurrentIteration]: We unified 461 AI predicates to 461 [2018-11-07 09:03:56,330 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:03:56,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:03:56,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-11-07 09:03:56,331 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:03:56,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 09:03:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 09:03:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 09:03:56,333 INFO L87 Difference]: Start difference. First operand 2290 states and 3256 transitions. Second operand 10 states. [2018-11-07 09:04:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:04:25,809 INFO L93 Difference]: Finished difference Result 4205 states and 6126 transitions. [2018-11-07 09:04:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 09:04:25,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 462 [2018-11-07 09:04:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:04:25,821 INFO L225 Difference]: With dead ends: 4205 [2018-11-07 09:04:25,821 INFO L226 Difference]: Without dead ends: 2104 [2018-11-07 09:04:25,829 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 469 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 09:04:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-11-07 09:04:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2101. [2018-11-07 09:04:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-11-07 09:04:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 3039 transitions. [2018-11-07 09:04:25,880 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 3039 transitions. Word has length 462 [2018-11-07 09:04:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:04:25,880 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 3039 transitions. [2018-11-07 09:04:25,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:04:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 3039 transitions. [2018-11-07 09:04:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-11-07 09:04:25,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:04:25,896 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:04:25,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:04:25,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:04:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash -734705564, now seen corresponding path program 1 times [2018-11-07 09:04:25,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:04:25,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:04:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:04:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:04:25,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:04:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:04:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 380 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 09:04:26,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:04:26,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:04:26,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 499 with the following transitions: [2018-11-07 09:04:26,563 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:04:26,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:04:26,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:04:34,742 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:04:34,743 INFO L272 AbstractInterpreter]: Visited 130 different actions 389 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 09:04:34,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:04:34,750 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:04:36,049 INFO L227 lantSequenceWeakener]: Weakened 495 states. On average, predicates are now at 80.29% of their original sizes. [2018-11-07 09:04:36,049 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:04:36,115 INFO L415 sIntCurrentIteration]: We unified 497 AI predicates to 497 [2018-11-07 09:04:36,115 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:04:36,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:04:36,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-11-07 09:04:36,115 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:04:36,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:04:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:04:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:04:36,116 INFO L87 Difference]: Start difference. First operand 2101 states and 3039 transitions. Second operand 9 states. [2018-11-07 09:04:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:04:55,838 INFO L93 Difference]: Finished difference Result 4547 states and 6798 transitions. [2018-11-07 09:04:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 09:04:55,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 498 [2018-11-07 09:04:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:04:55,850 INFO L225 Difference]: With dead ends: 4547 [2018-11-07 09:04:55,851 INFO L226 Difference]: Without dead ends: 2820 [2018-11-07 09:04:55,860 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 504 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:04:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2018-11-07 09:04:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2801. [2018-11-07 09:04:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-11-07 09:04:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3937 transitions. [2018-11-07 09:04:55,932 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3937 transitions. Word has length 498 [2018-11-07 09:04:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:04:55,933 INFO L480 AbstractCegarLoop]: Abstraction has 2801 states and 3937 transitions. [2018-11-07 09:04:55,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:04:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3937 transitions. [2018-11-07 09:04:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-11-07 09:04:55,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:04:55,956 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:04:55,956 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:04:55,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:04:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1899529555, now seen corresponding path program 1 times [2018-11-07 09:04:55,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:04:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:04:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:04:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:04:55,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:04:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:04:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 382 proven. 329 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:04:57,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:04:57,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:04:57,482 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 566 with the following transitions: [2018-11-07 09:04:57,483 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:04:57,486 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:04:57,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:05:02,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:05:02,961 INFO L272 AbstractInterpreter]: Visited 191 different actions 763 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 09:05:02,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:02,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:05:02,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:02,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:05:02,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:05:02,981 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:05:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:03,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:05:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 09:05:03,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:05:03,934 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-11-07 09:05:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 380 proven. 119 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 09:05:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:05:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2018-11-07 09:05:04,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:05:04,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 09:05:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 09:05:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-07 09:05:04,787 INFO L87 Difference]: Start difference. First operand 2801 states and 3937 transitions. Second operand 17 states. [2018-11-07 09:05:08,416 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-07 09:05:09,782 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-11-07 09:05:10,067 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-07 09:05:12,084 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-07 09:05:13,601 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-07 09:05:17,247 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-11-07 09:05:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:05:18,830 INFO L93 Difference]: Finished difference Result 6532 states and 9673 transitions. [2018-11-07 09:05:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 09:05:18,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 565 [2018-11-07 09:05:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:05:18,853 INFO L225 Difference]: With dead ends: 6532 [2018-11-07 09:05:18,854 INFO L226 Difference]: Without dead ends: 4105 [2018-11-07 09:05:18,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 09:05:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2018-11-07 09:05:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3984. [2018-11-07 09:05:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2018-11-07 09:05:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5122 transitions. [2018-11-07 09:05:18,989 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5122 transitions. Word has length 565 [2018-11-07 09:05:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:05:18,990 INFO L480 AbstractCegarLoop]: Abstraction has 3984 states and 5122 transitions. [2018-11-07 09:05:18,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 09:05:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5122 transitions. [2018-11-07 09:05:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-07 09:05:19,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:05:19,004 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:05:19,004 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:05:19,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash 757395771, now seen corresponding path program 1 times [2018-11-07 09:05:19,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:05:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:19,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:05:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:19,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:05:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:20,397 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 09:05:20,913 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 09:05:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 504 proven. 458 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 09:05:21,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:21,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:05:21,804 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 572 with the following transitions: [2018-11-07 09:05:21,804 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:05:21,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:05:21,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:05:32,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:05:32,188 INFO L272 AbstractInterpreter]: Visited 132 different actions 522 times. Merged at 8 different actions 30 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 24 variables. [2018-11-07 09:05:32,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:32,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:05:32,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:32,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:05:32,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:05:32,205 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:05:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:32,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:05:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 852 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-07 09:05:32,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:05:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 498 proven. 112 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-07 09:05:33,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:05:33,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-11-07 09:05:33,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:05:33,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 09:05:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 09:05:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:05:33,495 INFO L87 Difference]: Start difference. First operand 3984 states and 5122 transitions. Second operand 17 states. [2018-11-07 09:05:36,739 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-07 09:05:40,461 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2018-11-07 09:05:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:05:40,607 INFO L93 Difference]: Finished difference Result 9018 states and 12137 transitions. [2018-11-07 09:05:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 09:05:40,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 571 [2018-11-07 09:05:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:05:40,629 INFO L225 Difference]: With dead ends: 9018 [2018-11-07 09:05:40,629 INFO L226 Difference]: Without dead ends: 4293 [2018-11-07 09:05:40,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1153 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=521, Invalid=1735, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 09:05:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2018-11-07 09:05:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4166. [2018-11-07 09:05:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2018-11-07 09:05:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 4753 transitions. [2018-11-07 09:05:40,825 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 4753 transitions. Word has length 571 [2018-11-07 09:05:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:05:40,826 INFO L480 AbstractCegarLoop]: Abstraction has 4166 states and 4753 transitions. [2018-11-07 09:05:40,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 09:05:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 4753 transitions. [2018-11-07 09:05:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-11-07 09:05:40,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:05:40,837 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2018-11-07 09:05:40,838 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:05:40,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -37091984, now seen corresponding path program 2 times [2018-11-07 09:05:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:05:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:40,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:05:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:40,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:05:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 536 proven. 119 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-11-07 09:05:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:41,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:05:41,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 09:05:41,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 09:05:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:41,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:05:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 09:05:41,693 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 09:05:41,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 09:05:41,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 09:05:41,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:05:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 644 proven. 2 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2018-11-07 09:05:42,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:05:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 644 proven. 2 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2018-11-07 09:05:42,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:05:42,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 09:05:42,720 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:05:42,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:05:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:05:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 09:05:42,722 INFO L87 Difference]: Start difference. First operand 4166 states and 4753 transitions. Second operand 9 states. [2018-11-07 09:05:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:05:49,331 INFO L93 Difference]: Finished difference Result 15224 states and 20396 transitions. [2018-11-07 09:05:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 09:05:49,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 676 [2018-11-07 09:05:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:05:49,401 INFO L225 Difference]: With dead ends: 15224 [2018-11-07 09:05:49,401 INFO L226 Difference]: Without dead ends: 11432 [2018-11-07 09:05:49,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 1377 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 09:05:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11432 states. [2018-11-07 09:05:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11432 to 10584. [2018-11-07 09:05:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10584 states. [2018-11-07 09:05:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10584 states to 10584 states and 12154 transitions. [2018-11-07 09:05:49,776 INFO L78 Accepts]: Start accepts. Automaton has 10584 states and 12154 transitions. Word has length 676 [2018-11-07 09:05:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:05:49,777 INFO L480 AbstractCegarLoop]: Abstraction has 10584 states and 12154 transitions. [2018-11-07 09:05:49,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:05:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 10584 states and 12154 transitions. [2018-11-07 09:05:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-11-07 09:05:49,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:05:49,808 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:05:49,808 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:05:49,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash -722585145, now seen corresponding path program 1 times [2018-11-07 09:05:49,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:05:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:49,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 09:05:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:05:49,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:05:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 595 proven. 196 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2018-11-07 09:05:50,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:50,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:05:50,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 764 with the following transitions: [2018-11-07 09:05:50,553 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:05:50,555 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:05:50,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:05:56,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:05:56,194 INFO L272 AbstractInterpreter]: Visited 193 different actions 774 times. Merged at 10 different actions 38 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 5 different actions. Largest state had 24 variables. [2018-11-07 09:05:56,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:05:56,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:05:56,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:05:56,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:05:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:05:56,209 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:05:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:05:56,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:05:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1268 proven. 2 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-07 09:05:57,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:05:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 595 proven. 196 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2018-11-07 09:05:57,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:05:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-07 09:05:57,712 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:05:57,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 09:05:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 09:05:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:05:57,716 INFO L87 Difference]: Start difference. First operand 10584 states and 12154 transitions. Second operand 7 states. [2018-11-07 09:06:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:06:00,770 INFO L93 Difference]: Finished difference Result 25942 states and 34221 transitions. [2018-11-07 09:06:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 09:06:00,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 763 [2018-11-07 09:06:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:06:00,882 INFO L225 Difference]: With dead ends: 25942 [2018-11-07 09:06:00,882 INFO L226 Difference]: Without dead ends: 15732 [2018-11-07 09:06:00,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1541 GetRequests, 1528 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-07 09:06:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15732 states. [2018-11-07 09:06:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15732 to 14894. [2018-11-07 09:06:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14894 states. [2018-11-07 09:06:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14894 states to 14894 states and 17322 transitions. [2018-11-07 09:06:01,422 INFO L78 Accepts]: Start accepts. Automaton has 14894 states and 17322 transitions. Word has length 763 [2018-11-07 09:06:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:06:01,423 INFO L480 AbstractCegarLoop]: Abstraction has 14894 states and 17322 transitions. [2018-11-07 09:06:01,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 09:06:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14894 states and 17322 transitions. [2018-11-07 09:06:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2018-11-07 09:06:01,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:06:01,462 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:06:01,462 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:06:01,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:06:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1205896632, now seen corresponding path program 1 times [2018-11-07 09:06:01,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:06:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:06:01,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:06:01,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:06:01,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:06:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 09:06:01,648 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-07 09:06:01,655 INFO L168 Benchmark]: Toolchain (without parser) took 236960.06 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -66.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 09:06:01,656 INFO L168 Benchmark]: CDTParser took 0.24 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-11-07 09:06:01,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 09:06:01,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -797.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 09:06:01,658 INFO L168 Benchmark]: Boogie Preprocessor took 111.10 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 09:06:01,660 INFO L168 Benchmark]: RCFGBuilder took 3639.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. [2018-11-07 09:06:01,661 INFO L168 Benchmark]: TraceAbstraction took 232215.58 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 557.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 09:06:01,666 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.24 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 821.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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 163.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -797.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.10 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3639.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232215.58 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 557.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown