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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 03:25:11,840 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 03:25:11,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 03:25:11,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 03:25:11,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 03:25:11,862 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 03:25:11,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 03:25:11,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 03:25:11,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 03:25:11,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 03:25:11,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 03:25:11,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 03:25:11,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 03:25:11,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 03:25:11,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 03:25:11,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 03:25:11,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 03:25:11,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 03:25:11,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 03:25:11,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 03:25:11,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 03:25:11,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 03:25:11,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 03:25:11,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 03:25:11,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 03:25:11,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 03:25:11,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 03:25:11,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 03:25:11,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 03:25:11,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 03:25:11,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 03:25:11,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 03:25:11,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 03:25:11,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 03:25:11,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 03:25:11,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 03:25:11,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 03:25:11,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 03:25:11,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 03:25:11,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 03:25:11,945 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 03:25:11,945 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 03:25:11,945 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 03:25:11,945 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 03:25:11,946 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 03:25:11,946 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 03:25:11,947 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 03:25:11,947 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 03:25:11,947 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 03:25:11,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 03:25:11,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 03:25:11,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 03:25:11,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 03:25:11,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 03:25:11,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 03:25:11,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 03:25:11,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 03:25:11,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 03:25:11,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 03:25:11,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 03:25:11,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 03:25:11,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 03:25:11,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 03:25:11,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 03:25:11,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 03:25:11,954 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 03:25:12,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 03:25:12,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 03:25:12,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 03:25:12,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 03:25:12,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 03:25:12,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 03:25:12,118 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540390cf6/81f2635f691d4ab1b5d1272171a88bac/FLAG185ed20bf [2018-11-07 03:25:12,702 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 03:25:12,703 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 03:25:12,730 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540390cf6/81f2635f691d4ab1b5d1272171a88bac/FLAG185ed20bf [2018-11-07 03:25:12,758 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540390cf6/81f2635f691d4ab1b5d1272171a88bac [2018-11-07 03:25:12,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 03:25:12,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 03:25:12,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 03:25:12,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 03:25:12,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 03:25:12,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:25:12" (1/1) ... [2018-11-07 03:25:12,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea9c6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:12, skipping insertion in model container [2018-11-07 03:25:12,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:25:12" (1/1) ... [2018-11-07 03:25:12,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 03:25:12,878 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 03:25:13,344 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:25:13,352 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 03:25:13,536 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:25:13,561 INFO L193 MainTranslator]: Completed translation [2018-11-07 03:25:13,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13 WrapperNode [2018-11-07 03:25:13,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 03:25:13,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 03:25:13,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 03:25:13,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 03:25:13,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 03:25:13,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 03:25:13,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 03:25:13,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 03:25:13,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (1/1) ... [2018-11-07 03:25:13,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 03:25:13,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 03:25:13,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 03:25:13,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 03:25:13,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (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 03:25:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 03:25:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 03:25:13,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 03:25:13,955 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 03:25:13,955 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 03:25:13,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 03:25:13,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 03:25:13,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 03:25:13,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 03:25:17,508 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 03:25:17,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:25:17 BoogieIcfgContainer [2018-11-07 03:25:17,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 03:25:17,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 03:25:17,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 03:25:17,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 03:25:17,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:25:12" (1/3) ... [2018-11-07 03:25:17,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977b47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:25:17, skipping insertion in model container [2018-11-07 03:25:17,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:25:13" (2/3) ... [2018-11-07 03:25:17,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977b47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:25:17, skipping insertion in model container [2018-11-07 03:25:17,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:25:17" (3/3) ... [2018-11-07 03:25:17,522 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 03:25:17,533 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 03:25:17,546 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 03:25:17,566 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 03:25:17,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 03:25:17,615 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 03:25:17,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 03:25:17,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 03:25:17,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 03:25:17,616 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 03:25:17,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 03:25:17,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 03:25:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 03:25:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 03:25:17,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:17,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:25:17,659 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:17,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -949219895, now seen corresponding path program 1 times [2018-11-07 03:25:17,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:17,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:17,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:18,168 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 03:25:18,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:18,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 03:25:18,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:18,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 03:25:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 03:25:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 03:25:18,197 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 03:25:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:19,983 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 03:25:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:25:19,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-07 03:25:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:20,005 INFO L225 Difference]: With dead ends: 691 [2018-11-07 03:25:20,005 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 03:25:20,014 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 03:25:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 03:25:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 03:25:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 03:25:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 772 transitions. [2018-11-07 03:25:20,144 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 772 transitions. Word has length 69 [2018-11-07 03:25:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:20,145 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 772 transitions. [2018-11-07 03:25:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 03:25:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 772 transitions. [2018-11-07 03:25:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 03:25:20,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:20,161 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, 2, 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 03:25:20,161 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:20,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1252535900, now seen corresponding path program 1 times [2018-11-07 03:25:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:20,165 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:20,536 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:25:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:20,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:25:20,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:20,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:25:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:25:20,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:25:20,607 INFO L87 Difference]: Start difference. First operand 434 states and 772 transitions. Second operand 6 states. [2018-11-07 03:25:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:24,084 INFO L93 Difference]: Finished difference Result 1234 states and 2250 transitions. [2018-11-07 03:25:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:25:24,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-07 03:25:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:24,094 INFO L225 Difference]: With dead ends: 1234 [2018-11-07 03:25:24,095 INFO L226 Difference]: Without dead ends: 806 [2018-11-07 03:25:24,100 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 03:25:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-07 03:25:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 797. [2018-11-07 03:25:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-07 03:25:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1300 transitions. [2018-11-07 03:25:24,156 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1300 transitions. Word has length 139 [2018-11-07 03:25:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:24,156 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1300 transitions. [2018-11-07 03:25:24,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:25:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1300 transitions. [2018-11-07 03:25:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 03:25:24,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:24,163 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, 2, 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 03:25:24,163 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:24,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1412263263, now seen corresponding path program 1 times [2018-11-07 03:25:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:24,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:25:24,474 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:24,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:25:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:25:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:25:24,476 INFO L87 Difference]: Start difference. First operand 797 states and 1300 transitions. Second operand 5 states. [2018-11-07 03:25:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:26,831 INFO L93 Difference]: Finished difference Result 2186 states and 3741 transitions. [2018-11-07 03:25:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:25:26,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-11-07 03:25:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:26,851 INFO L225 Difference]: With dead ends: 2186 [2018-11-07 03:25:26,851 INFO L226 Difference]: Without dead ends: 1395 [2018-11-07 03:25:26,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:25:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-11-07 03:25:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1369. [2018-11-07 03:25:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-07 03:25:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2191 transitions. [2018-11-07 03:25:26,912 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2191 transitions. Word has length 140 [2018-11-07 03:25:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 2191 transitions. [2018-11-07 03:25:26,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:25:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2191 transitions. [2018-11-07 03:25:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 03:25:26,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:26,916 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, 2, 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] [2018-11-07 03:25:26,916 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:26,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 531411331, now seen corresponding path program 1 times [2018-11-07 03:25:26,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:26,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:26,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:27,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:27,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:25:27,102 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:27,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:25:27,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:25:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:25:27,104 INFO L87 Difference]: Start difference. First operand 1369 states and 2191 transitions. Second operand 5 states. [2018-11-07 03:25:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:30,340 INFO L93 Difference]: Finished difference Result 3697 states and 5933 transitions. [2018-11-07 03:25:30,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:25:30,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-07 03:25:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:30,357 INFO L225 Difference]: With dead ends: 3697 [2018-11-07 03:25:30,357 INFO L226 Difference]: Without dead ends: 2334 [2018-11-07 03:25:30,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:25:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-11-07 03:25:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2254. [2018-11-07 03:25:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-11-07 03:25:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3323 transitions. [2018-11-07 03:25:30,444 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3323 transitions. Word has length 142 [2018-11-07 03:25:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:30,445 INFO L480 AbstractCegarLoop]: Abstraction has 2254 states and 3323 transitions. [2018-11-07 03:25:30,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:25:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3323 transitions. [2018-11-07 03:25:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 03:25:30,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:30,449 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, 2, 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] [2018-11-07 03:25:30,449 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2121902484, now seen corresponding path program 1 times [2018-11-07 03:25:30,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:30,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:30,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:30,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:30,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:25:30,726 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:25:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:25:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:25:30,728 INFO L87 Difference]: Start difference. First operand 2254 states and 3323 transitions. Second operand 5 states. [2018-11-07 03:25:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:33,799 INFO L93 Difference]: Finished difference Result 6104 states and 9334 transitions. [2018-11-07 03:25:33,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 03:25:33,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 03:25:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:33,820 INFO L225 Difference]: With dead ends: 6104 [2018-11-07 03:25:33,820 INFO L226 Difference]: Without dead ends: 2950 [2018-11-07 03:25:33,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:25:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-11-07 03:25:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2927. [2018-11-07 03:25:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-11-07 03:25:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3799 transitions. [2018-11-07 03:25:33,922 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3799 transitions. Word has length 143 [2018-11-07 03:25:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 2927 states and 3799 transitions. [2018-11-07 03:25:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:25:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3799 transitions. [2018-11-07 03:25:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 03:25:33,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:33,933 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:25:33,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1248172171, now seen corresponding path program 1 times [2018-11-07 03:25:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:33,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:33,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:34,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:25:34,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:25:34,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:34,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:25:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:25:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:25:34,202 INFO L87 Difference]: Start difference. First operand 2927 states and 3799 transitions. Second operand 4 states. [2018-11-07 03:25:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:25:35,523 INFO L93 Difference]: Finished difference Result 5839 states and 7641 transitions. [2018-11-07 03:25:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:25:35,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-11-07 03:25:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:25:35,541 INFO L225 Difference]: With dead ends: 5839 [2018-11-07 03:25:35,541 INFO L226 Difference]: Without dead ends: 3110 [2018-11-07 03:25:35,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:25:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-11-07 03:25:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2018-11-07 03:25:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2018-11-07 03:25:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 3994 transitions. [2018-11-07 03:25:35,642 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 3994 transitions. Word has length 242 [2018-11-07 03:25:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:25:35,642 INFO L480 AbstractCegarLoop]: Abstraction has 3110 states and 3994 transitions. [2018-11-07 03:25:35,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:25:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 3994 transitions. [2018-11-07 03:25:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-07 03:25:35,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:25:35,657 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:25:35,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:25:35,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2039548178, now seen corresponding path program 1 times [2018-11-07 03:25:35,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:25:35,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:35,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:25:35,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:25:35,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:25:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:25:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:25:36,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:25:36,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:25:36,809 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-11-07 03:25:36,811 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:25:36,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:25:36,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:25:39,304 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:25:44,374 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:25:44,375 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 03:25:44,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:25:44,421 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:25:47,511 INFO L227 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 78.18% of their original sizes. [2018-11-07 03:25:47,511 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:25:47,978 INFO L415 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2018-11-07 03:25:47,978 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:25:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:25:47,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-07 03:25:47,980 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:25:47,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 03:25:47,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 03:25:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 03:25:47,981 INFO L87 Difference]: Start difference. First operand 3110 states and 3994 transitions. Second operand 7 states. [2018-11-07 03:26:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:26:13,401 INFO L93 Difference]: Finished difference Result 6399 states and 8193 transitions. [2018-11-07 03:26:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:26:13,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2018-11-07 03:26:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:26:13,419 INFO L225 Difference]: With dead ends: 6399 [2018-11-07 03:26:13,419 INFO L226 Difference]: Without dead ends: 3295 [2018-11-07 03:26:13,431 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:26:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2018-11-07 03:26:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3293. [2018-11-07 03:26:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2018-11-07 03:26:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4179 transitions. [2018-11-07 03:26:13,540 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4179 transitions. Word has length 284 [2018-11-07 03:26:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:26:13,541 INFO L480 AbstractCegarLoop]: Abstraction has 3293 states and 4179 transitions. [2018-11-07 03:26:13,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 03:26:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4179 transitions. [2018-11-07 03:26:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 03:26:13,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:26:13,560 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:26:13,560 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:26:13,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:26:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -806219320, now seen corresponding path program 1 times [2018-11-07 03:26:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:26:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:26:13,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:26:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:26:13,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:26:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:26:14,129 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 03:26:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 199 proven. 297 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 03:26:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:26:15,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:26:15,123 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: [2018-11-07 03:26:15,123 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:26:15,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:26:15,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:26:16,449 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:26:23,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:26:23,945 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 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 03:26:23,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:26:23,952 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:26:28,124 INFO L227 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 78.33% of their original sizes. [2018-11-07 03:26:28,124 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:26:35,190 INFO L415 sIntCurrentIteration]: We unified 394 AI predicates to 394 [2018-11-07 03:26:35,190 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:26:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:26:35,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2018-11-07 03:26:35,191 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:26:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 03:26:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 03:26:35,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-07 03:26:35,192 INFO L87 Difference]: Start difference. First operand 3293 states and 4179 transitions. Second operand 17 states. [2018-11-07 03:28:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:28:57,290 INFO L93 Difference]: Finished difference Result 6583 states and 8383 transitions. [2018-11-07 03:28:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 03:28:57,290 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 395 [2018-11-07 03:28:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:28:57,305 INFO L225 Difference]: With dead ends: 6583 [2018-11-07 03:28:57,305 INFO L226 Difference]: Without dead ends: 3479 [2018-11-07 03:28:57,316 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 403 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-11-07 03:28:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2018-11-07 03:28:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3469. [2018-11-07 03:28:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2018-11-07 03:28:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4337 transitions. [2018-11-07 03:28:57,491 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4337 transitions. Word has length 395 [2018-11-07 03:28:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:28:57,492 INFO L480 AbstractCegarLoop]: Abstraction has 3469 states and 4337 transitions. [2018-11-07 03:28:57,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 03:28:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4337 transitions. [2018-11-07 03:28:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-07 03:28:57,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:28:57,516 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:28:57,516 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:28:57,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:28:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1783785411, now seen corresponding path program 1 times [2018-11-07 03:28:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:28:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:28:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:28:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:28:57,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:28:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:28:58,442 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 14 [2018-11-07 03:28:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 03:28:59,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:28:59,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:28:59,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 506 with the following transitions: [2018-11-07 03:28:59,073 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], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:28:59,077 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:28:59,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:29:00,426 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 03:29:03,570 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 03:29:03,571 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 03:29:03,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 03:29:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:29:03,572 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 03:29:03,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:29:03,678 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 03:29:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:29:03,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 03:29:03,904 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 03:29:04,106 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 03:29:04,107 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 03:29:04,113 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 03:29:04,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:29:04 BoogieIcfgContainer [2018-11-07 03:29:04,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 03:29:04,115 INFO L168 Benchmark]: Toolchain (without parser) took 231341.62 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 221.3 MB. Max. memory is 7.1 GB. [2018-11-07 03:29:04,116 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 03:29:04,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.03 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-11-07 03:29:04,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 180.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 03:29:04,118 INFO L168 Benchmark]: Boogie Preprocessor took 131.56 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 03:29:04,119 INFO L168 Benchmark]: RCFGBuilder took 3635.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. [2018-11-07 03:29:04,121 INFO L168 Benchmark]: TraceAbstraction took 226601.82 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 146.7 MB. Max. memory is 7.1 GB. [2018-11-07 03:29:04,126 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.03 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 180.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.56 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3635.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226601.82 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 146.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 190]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 190). Cancelled while BasicCegarLoop was analyzing trace of length 506 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 226.5s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 183.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1390 SDtfs, 5719 SDslu, 1035 SDs, 0 SdLazy, 9251 SolverSat, 1815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 734 GetRequests, 674 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3469occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.9s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9963901911673408 AbsIntWeakeningRatio, 0.08567208271787297 AbsIntAvgWeakeningVarsNumRemoved, 393.1802067946824 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 150 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 3419291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 738/1037 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown