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-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 17:50:11,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 17:50:11,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 17:50:11,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 17:50:11,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 17:50:11,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 17:50:11,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 17:50:11,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 17:50:11,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 17:50:11,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 17:50:11,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 17:50:11,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 17:50:11,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 17:50:11,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 17:50:11,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 17:50:11,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 17:50:11,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 17:50:11,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 17:50:11,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 17:50:11,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 17:50:11,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 17:50:11,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 17:50:11,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 17:50:11,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 17:50:11,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 17:50:11,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 17:50:11,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 17:50:11,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 17:50:11,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 17:50:11,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 17:50:11,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 17:50:11,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 17:50:11,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 17:50:11,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 17:50:11,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 17:50:11,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 17:50:11,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 17:50:11,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 17:50:11,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 17:50:11,854 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 17:50:11,854 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 17:50:11,854 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 17:50:11,855 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 17:50:11,855 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 17:50:11,855 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 17:50:11,855 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 17:50:11,855 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 17:50:11,856 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 17:50:11,856 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 17:50:11,856 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 17:50:11,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 17:50:11,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 17:50:11,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 17:50:11,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 17:50:11,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 17:50:11,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 17:50:11,858 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 17:50:11,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 17:50:11,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 17:50:11,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 17:50:11,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 17:50:11,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 17:50:11,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 17:50:11,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 17:50:11,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 17:50:11,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 17:50:11,862 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 17:50:11,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 17:50:11,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 17:50:11,863 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 17:50:11,863 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 17:50:11,863 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 17:50:11,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 17:50:11,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 17:50:11,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 17:50:11,930 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 17:50:11,930 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 17:50:11,931 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c [2018-11-07 17:50:11,998 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134940ebc/20f724e26533401997a043029e8ed479/FLAG181cf3f4f [2018-11-07 17:50:12,725 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 17:50:12,726 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c [2018-11-07 17:50:12,770 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134940ebc/20f724e26533401997a043029e8ed479/FLAG181cf3f4f [2018-11-07 17:50:12,790 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134940ebc/20f724e26533401997a043029e8ed479 [2018-11-07 17:50:12,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 17:50:12,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 17:50:12,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 17:50:12,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 17:50:12,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 17:50:12,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:12" (1/1) ... [2018-11-07 17:50:12,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fab143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:12, skipping insertion in model container [2018-11-07 17:50:12,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:12" (1/1) ... [2018-11-07 17:50:12,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 17:50:13,006 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 17:50:14,285 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:50:14,291 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 17:50:14,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:50:14,951 INFO L193 MainTranslator]: Completed translation [2018-11-07 17:50:14,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14 WrapperNode [2018-11-07 17:50:14,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 17:50:14,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 17:50:14,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 17:50:14,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 17:50:14,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 17:50:15,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 17:50:15,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 17:50:15,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 17:50:15,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (1/1) ... [2018-11-07 17:50:15,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 17:50:15,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 17:50:15,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 17:50:15,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 17:50:15,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (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 17:50:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 17:50:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 17:50:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 17:50:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 17:50:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 17:50:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 17:50:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 17:50:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 17:50:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 17:50:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 17:50:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 17:50:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 17:50:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 17:50:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 17:50:15,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 17:50:23,908 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 17:50:23,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:23 BoogieIcfgContainer [2018-11-07 17:50:23,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 17:50:23,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 17:50:23,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 17:50:23,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 17:50:23,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:50:12" (1/3) ... [2018-11-07 17:50:23,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec0a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:23, skipping insertion in model container [2018-11-07 17:50:23,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:14" (2/3) ... [2018-11-07 17:50:23,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec0a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:23, skipping insertion in model container [2018-11-07 17:50:23,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:23" (3/3) ... [2018-11-07 17:50:23,918 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label37_false-unreach-call.c [2018-11-07 17:50:23,929 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 17:50:23,938 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 17:50:23,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 17:50:24,010 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 17:50:24,010 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 17:50:24,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 17:50:24,011 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 17:50:24,011 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 17:50:24,011 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 17:50:24,011 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 17:50:24,011 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 17:50:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-07 17:50:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 17:50:24,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:50:24,080 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] [2018-11-07 17:50:24,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:50:24,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:50:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2022607172, now seen corresponding path program 1 times [2018-11-07 17:50:24,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:50:24,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:50:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:24,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:50:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:50:24,648 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:50:24,761 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 17:50:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:50:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:50:24,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:50:24,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:50:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:50:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:50:24,791 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-11-07 17:50:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:50:33,614 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-11-07 17:50:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:50:33,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 17:50:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:50:33,655 INFO L225 Difference]: With dead ends: 2446 [2018-11-07 17:50:33,655 INFO L226 Difference]: Without dead ends: 1604 [2018-11-07 17:50:33,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:50:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-07 17:50:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-07 17:50:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-07 17:50:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-11-07 17:50:33,836 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 20 [2018-11-07 17:50:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:50:33,837 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-11-07 17:50:33,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:50:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-11-07 17:50:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-07 17:50:33,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:50:33,843 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:50:33,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:50:33,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:50:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1778417694, now seen corresponding path program 1 times [2018-11-07 17:50:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:50:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:33,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:50:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:33,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:50:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:50:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:50:34,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:50:34,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:50:34,093 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:50:34,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:50:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:50:34,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:50:34,095 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 4 states. [2018-11-07 17:50:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:50:45,934 INFO L93 Difference]: Finished difference Result 6274 states and 11427 transitions. [2018-11-07 17:50:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:50:45,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-07 17:50:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:50:45,970 INFO L225 Difference]: With dead ends: 6274 [2018-11-07 17:50:45,971 INFO L226 Difference]: Without dead ends: 4676 [2018-11-07 17:50:45,982 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 17:50:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-11-07 17:50:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4676. [2018-11-07 17:50:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-11-07 17:50:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7992 transitions. [2018-11-07 17:50:46,135 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7992 transitions. Word has length 96 [2018-11-07 17:50:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:50:46,136 INFO L480 AbstractCegarLoop]: Abstraction has 4676 states and 7992 transitions. [2018-11-07 17:50:46,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:50:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7992 transitions. [2018-11-07 17:50:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-07 17:50:46,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:50:46,148 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:50:46,148 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:50:46,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:50:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1546584746, now seen corresponding path program 1 times [2018-11-07 17:50:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:50:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:50:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:46,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:50:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:50:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:50:46,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:50:46,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:50:46,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:50:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:50:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:50:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:50:46,391 INFO L87 Difference]: Start difference. First operand 4676 states and 7992 transitions. Second operand 5 states. [2018-11-07 17:50:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:50:54,300 INFO L93 Difference]: Finished difference Result 14214 states and 24823 transitions. [2018-11-07 17:50:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 17:50:54,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-07 17:50:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:50:54,362 INFO L225 Difference]: With dead ends: 14214 [2018-11-07 17:50:54,362 INFO L226 Difference]: Without dead ends: 9544 [2018-11-07 17:50:54,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:50:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2018-11-07 17:50:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9456. [2018-11-07 17:50:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9456 states. [2018-11-07 17:50:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 14962 transitions. [2018-11-07 17:50:54,689 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 14962 transitions. Word has length 100 [2018-11-07 17:50:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:50:54,690 INFO L480 AbstractCegarLoop]: Abstraction has 9456 states and 14962 transitions. [2018-11-07 17:50:54,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:50:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 14962 transitions. [2018-11-07 17:50:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 17:50:54,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:50:54,699 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:50:54,699 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:50:54,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:50:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 36653875, now seen corresponding path program 1 times [2018-11-07 17:50:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:50:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:50:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:50:54,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:50:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:50:54,984 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:50:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:50:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:50:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:50:55,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:50:55,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:50:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:50:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:50:55,304 INFO L87 Difference]: Start difference. First operand 9456 states and 14962 transitions. Second operand 6 states. [2018-11-07 17:51:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:51:08,350 INFO L93 Difference]: Finished difference Result 22338 states and 35508 transitions. [2018-11-07 17:51:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:51:08,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-07 17:51:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:51:08,414 INFO L225 Difference]: With dead ends: 22338 [2018-11-07 17:51:08,414 INFO L226 Difference]: Without dead ends: 12888 [2018-11-07 17:51:08,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 17:51:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12888 states. [2018-11-07 17:51:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12888 to 12853. [2018-11-07 17:51:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12853 states. [2018-11-07 17:51:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12853 states to 12853 states and 19481 transitions. [2018-11-07 17:51:08,771 INFO L78 Accepts]: Start accepts. Automaton has 12853 states and 19481 transitions. Word has length 111 [2018-11-07 17:51:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:51:08,771 INFO L480 AbstractCegarLoop]: Abstraction has 12853 states and 19481 transitions. [2018-11-07 17:51:08,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:51:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12853 states and 19481 transitions. [2018-11-07 17:51:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 17:51:08,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:51:08,773 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:51:08,774 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:51:08,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:51:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 586101302, now seen corresponding path program 1 times [2018-11-07 17:51:08,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:51:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:51:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:08,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:51:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:51:09,035 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:51:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:51:09,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:51:09,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:51:09,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:51:09,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:51:09,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:51:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:51:09,422 INFO L87 Difference]: Start difference. First operand 12853 states and 19481 transitions. Second operand 6 states. [2018-11-07 17:51:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:51:16,278 INFO L93 Difference]: Finished difference Result 35975 states and 57761 transitions. [2018-11-07 17:51:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:51:16,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-11-07 17:51:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:51:16,382 INFO L225 Difference]: With dead ends: 35975 [2018-11-07 17:51:16,382 INFO L226 Difference]: Without dead ends: 23128 [2018-11-07 17:51:16,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 17:51:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23128 states. [2018-11-07 17:51:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23128 to 22860. [2018-11-07 17:51:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22860 states. [2018-11-07 17:51:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22860 states to 22860 states and 35054 transitions. [2018-11-07 17:51:17,168 INFO L78 Accepts]: Start accepts. Automaton has 22860 states and 35054 transitions. Word has length 116 [2018-11-07 17:51:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:51:17,169 INFO L480 AbstractCegarLoop]: Abstraction has 22860 states and 35054 transitions. [2018-11-07 17:51:17,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:51:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22860 states and 35054 transitions. [2018-11-07 17:51:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 17:51:17,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:51:17,172 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:51:17,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:51:17,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:51:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash -220169182, now seen corresponding path program 1 times [2018-11-07 17:51:17,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:51:17,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:17,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:51:17,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:17,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:51:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:51:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:51:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:51:17,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:51:17,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:51:17,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:51:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:51:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:51:17,557 INFO L87 Difference]: Start difference. First operand 22860 states and 35054 transitions. Second operand 5 states. [2018-11-07 17:51:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:51:30,553 INFO L93 Difference]: Finished difference Result 74787 states and 121732 transitions. [2018-11-07 17:51:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:51:30,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-07 17:51:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:51:30,739 INFO L225 Difference]: With dead ends: 74787 [2018-11-07 17:51:30,740 INFO L226 Difference]: Without dead ends: 51933 [2018-11-07 17:51:30,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 17:51:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51933 states. [2018-11-07 17:51:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51933 to 51493. [2018-11-07 17:51:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51493 states. [2018-11-07 17:51:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51493 states to 51493 states and 73085 transitions. [2018-11-07 17:51:31,839 INFO L78 Accepts]: Start accepts. Automaton has 51493 states and 73085 transitions. Word has length 142 [2018-11-07 17:51:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:51:31,840 INFO L480 AbstractCegarLoop]: Abstraction has 51493 states and 73085 transitions. [2018-11-07 17:51:31,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:51:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 51493 states and 73085 transitions. [2018-11-07 17:51:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 17:51:31,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:51:31,846 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:51:31,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:51:31,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:51:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash -387409999, now seen corresponding path program 1 times [2018-11-07 17:51:31,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:51:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:51:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:51:31,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:51:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:51:32,162 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:51:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 17:51:32,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:51:32,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:51:32,581 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 17:51:32,584 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1927], [1929], [1932], [1940], [1948], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2564], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 17:51:32,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:51:32,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:51:33,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:51:33,302 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 17:51:33,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:51:33,339 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:51:33,940 INFO L227 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 74.96% of their original sizes. [2018-11-07 17:51:33,940 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:51:34,172 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-07 17:51:34,172 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:51:34,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:51:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-07 17:51:34,174 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:51:34,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 17:51:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 17:51:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:51:34,175 INFO L87 Difference]: Start difference. First operand 51493 states and 73085 transitions. Second operand 8 states. [2018-11-07 17:51:40,441 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:52:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:52:20,331 INFO L93 Difference]: Finished difference Result 103750 states and 147067 transitions. [2018-11-07 17:52:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 17:52:20,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2018-11-07 17:52:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:52:20,491 INFO L225 Difference]: With dead ends: 103750 [2018-11-07 17:52:20,492 INFO L226 Difference]: Without dead ends: 52263 [2018-11-07 17:52:20,588 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 17:52:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52263 states. [2018-11-07 17:52:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52263 to 52261. [2018-11-07 17:52:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52261 states. [2018-11-07 17:52:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52261 states to 52261 states and 73866 transitions. [2018-11-07 17:52:21,641 INFO L78 Accepts]: Start accepts. Automaton has 52261 states and 73866 transitions. Word has length 221 [2018-11-07 17:52:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:52:21,641 INFO L480 AbstractCegarLoop]: Abstraction has 52261 states and 73866 transitions. [2018-11-07 17:52:21,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 17:52:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 52261 states and 73866 transitions. [2018-11-07 17:52:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 17:52:21,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:52:21,650 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 17:52:21,651 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:52:21,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:52:21,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1890161797, now seen corresponding path program 1 times [2018-11-07 17:52:21,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:52:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:52:21,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:52:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:52:21,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:52:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:52:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-07 17:52:21,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:52:21,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:52:21,933 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:52:21,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:52:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:52:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:52:21,934 INFO L87 Difference]: Start difference. First operand 52261 states and 73866 transitions. Second operand 3 states. [2018-11-07 17:52:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:52:27,980 INFO L93 Difference]: Finished difference Result 122600 states and 184170 transitions. [2018-11-07 17:52:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:52:27,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-07 17:52:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:52:28,276 INFO L225 Difference]: With dead ends: 122600 [2018-11-07 17:52:28,277 INFO L226 Difference]: Without dead ends: 71113 [2018-11-07 17:52:28,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:52:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71113 states. [2018-11-07 17:52:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71113 to 71095. [2018-11-07 17:52:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71095 states. [2018-11-07 17:52:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71095 states to 71095 states and 105812 transitions. [2018-11-07 17:52:39,426 INFO L78 Accepts]: Start accepts. Automaton has 71095 states and 105812 transitions. Word has length 261 [2018-11-07 17:52:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:52:39,427 INFO L480 AbstractCegarLoop]: Abstraction has 71095 states and 105812 transitions. [2018-11-07 17:52:39,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:52:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 71095 states and 105812 transitions. [2018-11-07 17:52:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-07 17:52:39,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:52:39,440 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 17:52:39,441 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:52:39,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:52:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -459746984, now seen corresponding path program 1 times [2018-11-07 17:52:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:52:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:52:39,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:52:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:52:39,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:52:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:52:39,748 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:52:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 20 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:52:39,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:52:39,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:52:39,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-11-07 17:52:39,902 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1927], [1929], [1932], [1940], [1948], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2568], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 17:52:39,908 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:52:39,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:52:40,050 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:52:40,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:52:40,267 INFO L272 AbstractInterpreter]: Visited 154 different actions 302 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 17:52:40,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:52:40,294 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:52:40,901 INFO L227 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 75.7% of their original sizes. [2018-11-07 17:52:40,901 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:52:41,374 INFO L415 sIntCurrentIteration]: We unified 287 AI predicates to 287 [2018-11-07 17:52:41,375 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:52:41,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:52:41,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [8] total 27 [2018-11-07 17:52:41,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:52:41,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 17:52:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 17:52:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 17:52:41,377 INFO L87 Difference]: Start difference. First operand 71095 states and 105812 transitions. Second operand 21 states. Received shutdown request... [2018-11-07 17:53:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 17:53:39,346 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 17:53:39,354 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 17:53:39,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:53:39 BoogieIcfgContainer [2018-11-07 17:53:39,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 17:53:39,357 INFO L168 Benchmark]: Toolchain (without parser) took 206552.63 ms. Allocated memory was 1.5 GB in the beginning and 5.7 GB in the end (delta: 4.1 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,359 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 17:53:39,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2144.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 386.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,362 INFO L168 Benchmark]: Boogie Preprocessor took 240.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,363 INFO L168 Benchmark]: RCFGBuilder took 8327.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 665.3 MB). Peak memory consumption was 665.3 MB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,363 INFO L168 Benchmark]: TraceAbstraction took 195446.14 ms. Allocated memory was 2.3 GB in the beginning and 5.7 GB in the end (delta: 3.3 GB). Free memory was 1.6 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2018-11-07 17:53:39,368 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 2144.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 386.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 240.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8327.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 665.3 MB). Peak memory consumption was 665.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195446.14 ms. Allocated memory was 2.3 GB in the beginning and 5.7 GB in the end (delta: 3.3 GB). Free memory was 1.6 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 51). Cancelled while BasicCegarLoop was constructing difference of abstraction (71095states) and FLOYD_HOARE automaton (currently 18 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (35450 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 195.3s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 173.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3349 SDtfs, 20061 SDslu, 1745 SDs, 0 SdLazy, 45896 SolverSat, 7450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 569 GetRequests, 500 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71095occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.997664930758576 AbsIntWeakeningRatio, 0.10650887573964497 AbsIntAvgWeakeningVarsNumRemoved, 18.1439842209073 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 851 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1346 ConstructedInterpolants, 0 QuantifiedInterpolants, 839137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 233/436 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown