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/Problem15_label18_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:34:23,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:34:23,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:34:23,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:34:23,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:34:23,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:34:23,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:34:23,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:34:23,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:34:23,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:34:23,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:34:23,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:34:23,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:34:23,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:34:23,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:34:23,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:34:23,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:34:23,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:34:23,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:34:23,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:34:23,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:34:23,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:34:23,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:34:23,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:34:23,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:34:23,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:34:23,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:34:23,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:34:23,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:34:23,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:34:23,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:34:23,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:34:23,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:34:23,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:34:23,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:34:23,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:34:23,166 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-12 16:34:23,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:34:23,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:34:23,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:34:23,193 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:34:23,193 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:34:23,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:34:23,194 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:34:23,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:34:23,194 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:34:23,194 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:34:23,195 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:34:23,195 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:34:23,195 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:34:23,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:34:23,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:34:23,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:34:23,197 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:34:23,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:34:23,197 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:34:23,198 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:34:23,198 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:34:23,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:34:23,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:34:23,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:34:23,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:34:23,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:34:23,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:34:23,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:34:23,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:34:23,201 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:34:23,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:34:23,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:34:23,201 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:34:23,201 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:34:23,202 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:34:23,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:34:23,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:34:23,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:34:23,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:34:23,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:34:23,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label18_false-unreach-call_false-termination.c [2018-11-12 16:34:23,345 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852284145/c0013eda3b1d4e2398d0ab7097acb4fb/FLAGbfb2483d5 [2018-11-12 16:34:24,028 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:34:24,029 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label18_false-unreach-call_false-termination.c [2018-11-12 16:34:24,048 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852284145/c0013eda3b1d4e2398d0ab7097acb4fb/FLAGbfb2483d5 [2018-11-12 16:34:24,064 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852284145/c0013eda3b1d4e2398d0ab7097acb4fb [2018-11-12 16:34:24,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:34:24,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:34:24,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:34:24,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:34:24,081 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:34:24,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:34:24" (1/1) ... [2018-11-12 16:34:24,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753ccb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:24, skipping insertion in model container [2018-11-12 16:34:24,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:34:24" (1/1) ... [2018-11-12 16:34:24,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:34:24,210 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:34:25,052 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:34:25,057 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:34:25,382 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:34:25,405 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:34:25,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25 WrapperNode [2018-11-12 16:34:25,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:34:25,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:34:25,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:34:25,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:34:25,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:34:25,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:34:25,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:34:25,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:34:25,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (1/1) ... [2018-11-12 16:34:25,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:34:25,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:34:25,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:34:25,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:34:25,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (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-12 16:34:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:34:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:34:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:34:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 16:34:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 16:34:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:34:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:34:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:34:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:34:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:34:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:34:31,926 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:34:31,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:34:31 BoogieIcfgContainer [2018-11-12 16:34:31,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:34:31,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:34:31,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:34:31,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:34:31,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:34:24" (1/3) ... [2018-11-12 16:34:31,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:34:31, skipping insertion in model container [2018-11-12 16:34:31,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:34:25" (2/3) ... [2018-11-12 16:34:31,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:34:31, skipping insertion in model container [2018-11-12 16:34:31,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:34:31" (3/3) ... [2018-11-12 16:34:31,937 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label18_false-unreach-call_false-termination.c [2018-11-12 16:34:31,947 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:34:31,955 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:34:31,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:34:32,014 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:34:32,014 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:34:32,014 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:34:32,014 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:34:32,014 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:34:32,015 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:34:32,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:34:32,015 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:34:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-12 16:34:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 16:34:32,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:34:32,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:34:32,066 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:34:32,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:34:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1622466265, now seen corresponding path program 1 times [2018-11-12 16:34:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:34:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:32,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:34:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:32,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:34:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:34:32,512 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-12 16:34:32,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:34:32,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:34:32,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:34:32,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:34:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:34:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:34:32,543 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-11-12 16:34:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:34:39,250 INFO L93 Difference]: Finished difference Result 1514 states and 2777 transitions. [2018-11-12 16:34:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:34:39,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-12 16:34:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:34:39,280 INFO L225 Difference]: With dead ends: 1514 [2018-11-12 16:34:39,281 INFO L226 Difference]: Without dead ends: 1070 [2018-11-12 16:34:39,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:34:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-11-12 16:34:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1068. [2018-11-12 16:34:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-12 16:34:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1675 transitions. [2018-11-12 16:34:39,443 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1675 transitions. Word has length 15 [2018-11-12 16:34:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:34:39,444 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1675 transitions. [2018-11-12 16:34:39,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:34:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1675 transitions. [2018-11-12 16:34:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-12 16:34:39,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:34:39,448 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:34:39,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:34:39,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:34:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1644253011, now seen corresponding path program 1 times [2018-11-12 16:34:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:34:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:34:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:39,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:34:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:34:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:34:39,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:34:39,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:34:39,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:34:39,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:34:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:34:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:34:39,735 INFO L87 Difference]: Start difference. First operand 1068 states and 1675 transitions. Second operand 3 states. [2018-11-12 16:34:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:34:44,295 INFO L93 Difference]: Finished difference Result 3059 states and 4890 transitions. [2018-11-12 16:34:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:34:44,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-12 16:34:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:34:44,313 INFO L225 Difference]: With dead ends: 3059 [2018-11-12 16:34:44,314 INFO L226 Difference]: Without dead ends: 1997 [2018-11-12 16:34:44,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:34:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-11-12 16:34:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2018-11-12 16:34:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-11-12 16:34:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2748 transitions. [2018-11-12 16:34:44,398 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2748 transitions. Word has length 85 [2018-11-12 16:34:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:34:44,398 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 2748 transitions. [2018-11-12 16:34:44,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:34:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2748 transitions. [2018-11-12 16:34:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-12 16:34:44,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:34:44,407 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:34:44,408 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:34:44,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:34:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash -76739898, now seen corresponding path program 1 times [2018-11-12 16:34:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:34:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:34:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:34:44,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:34:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:34:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 17 proven. 77 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 16:34:44,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:34:44,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:34:44,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-12 16:34:44,873 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [629], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:34:44,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:34:44,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:34:45,455 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:34:47,628 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:34:47,630 INFO L272 AbstractInterpreter]: Visited 104 different actions 692 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Performed 12559 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:34:47,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:34:47,665 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:34:48,713 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 77.67% of their original sizes. [2018-11-12 16:34:48,713 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:34:52,987 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-12 16:34:52,987 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:34:52,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:34:52,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 16:34:52,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:34:52,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 16:34:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 16:34:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 16:34:52,991 INFO L87 Difference]: Start difference. First operand 1995 states and 2748 transitions. Second operand 18 states. [2018-11-12 16:35:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:35:53,115 INFO L93 Difference]: Finished difference Result 6521 states and 8450 transitions. [2018-11-12 16:35:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 16:35:53,115 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2018-11-12 16:35:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:35:53,137 INFO L225 Difference]: With dead ends: 6521 [2018-11-12 16:35:53,137 INFO L226 Difference]: Without dead ends: 4532 [2018-11-12 16:35:53,147 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 113 SyntacticMatches, 66 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 16:35:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2018-11-12 16:35:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 3809. [2018-11-12 16:35:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2018-11-12 16:35:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4631 transitions. [2018-11-12 16:35:53,252 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4631 transitions. Word has length 195 [2018-11-12 16:35:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:35:53,253 INFO L480 AbstractCegarLoop]: Abstraction has 3809 states and 4631 transitions. [2018-11-12 16:35:53,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 16:35:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4631 transitions. [2018-11-12 16:35:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-12 16:35:53,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:35:53,263 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:35:53,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:35:53,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:35:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1749750815, now seen corresponding path program 1 times [2018-11-12 16:35:53,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:35:53,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:35:53,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:35:53,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:35:53,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:35:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:35:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 16:35:54,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:35:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:35:54,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:35:54,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:35:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:35:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:35:54,367 INFO L87 Difference]: Start difference. First operand 3809 states and 4631 transitions. Second operand 3 states. [2018-11-12 16:35:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:35:56,999 INFO L93 Difference]: Finished difference Result 6728 states and 8951 transitions. [2018-11-12 16:35:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:35:57,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2018-11-12 16:35:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:35:57,031 INFO L225 Difference]: With dead ends: 6728 [2018-11-12 16:35:57,032 INFO L226 Difference]: Without dead ends: 4739 [2018-11-12 16:35:57,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:35:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2018-11-12 16:35:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4739. [2018-11-12 16:35:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2018-11-12 16:35:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 5717 transitions. [2018-11-12 16:35:57,151 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 5717 transitions. Word has length 371 [2018-11-12 16:35:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:35:57,153 INFO L480 AbstractCegarLoop]: Abstraction has 4739 states and 5717 transitions. [2018-11-12 16:35:57,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:35:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 5717 transitions. [2018-11-12 16:35:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-12 16:35:57,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:35:57,162 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:35:57,162 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:35:57,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:35:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1636810859, now seen corresponding path program 1 times [2018-11-12 16:35:57,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:35:57,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:35:57,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:35:57,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:35:57,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:35:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:35:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:35:57,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:35:57,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:35:57,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2018-11-12 16:35:57,870 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [633], [638], [640], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:35:57,896 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:35:57,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:35:58,159 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:35:58,498 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:35:58,499 INFO L272 AbstractInterpreter]: Visited 283 different actions 560 times. Merged at 5 different actions 5 times. Never widened. Performed 7993 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7993 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:35:58,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:35:58,525 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:35:59,228 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 78.13% of their original sizes. [2018-11-12 16:35:59,229 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:35:59,796 INFO L415 sIntCurrentIteration]: We unified 376 AI predicates to 376 [2018-11-12 16:35:59,797 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:35:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:35:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-12 16:35:59,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:35:59,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 16:35:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 16:35:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:35:59,802 INFO L87 Difference]: Start difference. First operand 4739 states and 5717 transitions. Second operand 20 states. [2018-11-12 16:36:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:47,759 INFO L93 Difference]: Finished difference Result 8889 states and 11004 transitions. [2018-11-12 16:36:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 16:36:47,759 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 377 [2018-11-12 16:36:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:47,783 INFO L225 Difference]: With dead ends: 8889 [2018-11-12 16:36:47,783 INFO L226 Difference]: Without dead ends: 5970 [2018-11-12 16:36:47,793 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 393 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 16:36:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2018-11-12 16:36:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 5963. [2018-11-12 16:36:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5963 states. [2018-11-12 16:36:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5963 states to 5963 states and 7034 transitions. [2018-11-12 16:36:47,924 INFO L78 Accepts]: Start accepts. Automaton has 5963 states and 7034 transitions. Word has length 377 [2018-11-12 16:36:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:47,925 INFO L480 AbstractCegarLoop]: Abstraction has 5963 states and 7034 transitions. [2018-11-12 16:36:47,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 16:36:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5963 states and 7034 transitions. [2018-11-12 16:36:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-11-12 16:36:47,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:47,939 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:36:47,940 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:47,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1848856695, now seen corresponding path program 1 times [2018-11-12 16:36:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:47,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:47,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:47,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:47,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-11-12 16:36:48,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:36:48,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:36:48,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 445 with the following transitions: [2018-11-12 16:36:48,467 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [566], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [629], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:36:48,473 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:36:48,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:36:48,524 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:36:49,803 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:36:49,804 INFO L272 AbstractInterpreter]: Visited 284 different actions 848 times. Merged at 7 different actions 18 times. Never widened. Performed 12888 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12888 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 16:36:49,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:49,809 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:36:50,209 INFO L227 lantSequenceWeakener]: Weakened 441 states. On average, predicates are now at 79.96% of their original sizes. [2018-11-12 16:36:50,209 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:36:50,303 INFO L415 sIntCurrentIteration]: We unified 443 AI predicates to 443 [2018-11-12 16:36:50,303 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:36:50,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:36:50,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-12 16:36:50,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:50,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 16:36:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 16:36:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:36:50,305 INFO L87 Difference]: Start difference. First operand 5963 states and 7034 transitions. Second operand 10 states. [2018-11-12 16:36:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:58,961 INFO L93 Difference]: Finished difference Result 10463 states and 12858 transitions. [2018-11-12 16:36:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 16:36:58,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 444 [2018-11-12 16:36:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:58,990 INFO L225 Difference]: With dead ends: 10463 [2018-11-12 16:36:58,990 INFO L226 Difference]: Without dead ends: 7544 [2018-11-12 16:36:59,002 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 450 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 16:36:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2018-11-12 16:36:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 7534. [2018-11-12 16:36:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7534 states. [2018-11-12 16:36:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7534 states to 7534 states and 8733 transitions. [2018-11-12 16:36:59,176 INFO L78 Accepts]: Start accepts. Automaton has 7534 states and 8733 transitions. Word has length 444 [2018-11-12 16:36:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:59,177 INFO L480 AbstractCegarLoop]: Abstraction has 7534 states and 8733 transitions. [2018-11-12 16:36:59,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 16:36:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7534 states and 8733 transitions. [2018-11-12 16:36:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-12 16:36:59,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:59,196 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:36:59,196 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:59,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1378188568, now seen corresponding path program 1 times [2018-11-12 16:36:59,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:59,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:59,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 16:36:59,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:36:59,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:36:59,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 486 with the following transitions: [2018-11-12 16:36:59,989 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [625], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:36:59,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:36:59,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:37:00,197 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:37:02,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:37:02,256 INFO L272 AbstractInterpreter]: Visited 285 different actions 1703 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Performed 29269 root evaluator evaluations with a maximum evaluation depth of 6. Performed 29269 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 16:37:02,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:02,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:37:02,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:02,262 INFO L192 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-12 16:37:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:02,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:37:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:02,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:37:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 16:37:02,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:37:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 16:37:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:37:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 16:37:03,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:37:03,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 16:37:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 16:37:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:37:03,449 INFO L87 Difference]: Start difference. First operand 7534 states and 8733 transitions. Second operand 9 states. [2018-11-12 16:37:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:12,063 INFO L93 Difference]: Finished difference Result 16008 states and 20630 transitions. [2018-11-12 16:37:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 16:37:12,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 485 [2018-11-12 16:37:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:12,115 INFO L225 Difference]: With dead ends: 16008 [2018-11-12 16:37:12,116 INFO L226 Difference]: Without dead ends: 12142 [2018-11-12 16:37:12,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-11-12 16:37:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2018-11-12 16:37:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 11748. [2018-11-12 16:37:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11748 states. [2018-11-12 16:37:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11748 states to 11748 states and 13958 transitions. [2018-11-12 16:37:12,368 INFO L78 Accepts]: Start accepts. Automaton has 11748 states and 13958 transitions. Word has length 485 [2018-11-12 16:37:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:12,369 INFO L480 AbstractCegarLoop]: Abstraction has 11748 states and 13958 transitions. [2018-11-12 16:37:12,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 16:37:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11748 states and 13958 transitions. [2018-11-12 16:37:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-12 16:37:12,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:12,391 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:37:12,392 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:12,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1443952746, now seen corresponding path program 1 times [2018-11-12 16:37:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:12,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:12,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-12 16:37:12,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:12,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:37:12,964 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 523 with the following transitions: [2018-11-12 16:37:12,964 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [629], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [962], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:37:12,969 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:37:12,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:37:13,018 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:37:13,674 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:37:13,675 INFO L272 AbstractInterpreter]: Visited 284 different actions 845 times. Merged at 7 different actions 15 times. Never widened. Performed 12781 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12781 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:37:13,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:13,682 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:37:14,167 INFO L227 lantSequenceWeakener]: Weakened 519 states. On average, predicates are now at 83.11% of their original sizes. [2018-11-12 16:37:14,167 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:37:14,503 INFO L415 sIntCurrentIteration]: We unified 521 AI predicates to 521 [2018-11-12 16:37:14,504 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:37:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:37:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-12 16:37:14,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:14,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 16:37:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 16:37:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:37:14,506 INFO L87 Difference]: Start difference. First operand 11748 states and 13958 transitions. Second operand 10 states. [2018-11-12 16:37:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:42,474 INFO L93 Difference]: Finished difference Result 19931 states and 24624 transitions. [2018-11-12 16:37:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 16:37:42,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 522 [2018-11-12 16:37:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:42,511 INFO L225 Difference]: With dead ends: 19931 [2018-11-12 16:37:42,512 INFO L226 Difference]: Without dead ends: 13620 [2018-11-12 16:37:42,530 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 528 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 16:37:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13620 states. [2018-11-12 16:37:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13620 to 13268. [2018-11-12 16:37:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13268 states. [2018-11-12 16:37:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13268 states to 13268 states and 15611 transitions. [2018-11-12 16:37:42,750 INFO L78 Accepts]: Start accepts. Automaton has 13268 states and 15611 transitions. Word has length 522 [2018-11-12 16:37:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:42,752 INFO L480 AbstractCegarLoop]: Abstraction has 13268 states and 15611 transitions. [2018-11-12 16:37:42,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 16:37:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13268 states and 15611 transitions. [2018-11-12 16:37:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-12 16:37:42,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:42,780 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:37:42,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:42,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1799340992, now seen corresponding path program 1 times [2018-11-12 16:37:42,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:42,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-12 16:37:43,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:37:43,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:37:43,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:43,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:37:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:37:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:43,223 INFO L87 Difference]: Start difference. First operand 13268 states and 15611 transitions. Second operand 3 states. [2018-11-12 16:37:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:47,538 INFO L93 Difference]: Finished difference Result 19884 states and 24448 transitions. [2018-11-12 16:37:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:37:47,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2018-11-12 16:37:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:47,595 INFO L225 Difference]: With dead ends: 19884 [2018-11-12 16:37:47,595 INFO L226 Difference]: Without dead ends: 13575 [2018-11-12 16:37:47,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2018-11-12 16:37:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 13267. [2018-11-12 16:37:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13267 states. [2018-11-12 16:37:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13267 states to 13267 states and 15610 transitions. [2018-11-12 16:37:47,844 INFO L78 Accepts]: Start accepts. Automaton has 13267 states and 15610 transitions. Word has length 531 [2018-11-12 16:37:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:47,845 INFO L480 AbstractCegarLoop]: Abstraction has 13267 states and 15610 transitions. [2018-11-12 16:37:47,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:37:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 13267 states and 15610 transitions. [2018-11-12 16:37:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-12 16:37:47,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:47,861 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:37:47,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 788223742, now seen corresponding path program 1 times [2018-11-12 16:37:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:47,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-12 16:37:49,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:37:49,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:37:49,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:37:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:37:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:49,009 INFO L87 Difference]: Start difference. First operand 13267 states and 15610 transitions. Second operand 3 states. [2018-11-12 16:37:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:51,961 INFO L93 Difference]: Finished difference Result 22713 states and 28772 transitions. [2018-11-12 16:37:51,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:37:51,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2018-11-12 16:37:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:52,014 INFO L225 Difference]: With dead ends: 22713 [2018-11-12 16:37:52,014 INFO L226 Difference]: Without dead ends: 16405 [2018-11-12 16:37:52,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16405 states. [2018-11-12 16:37:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16405 to 16402. [2018-11-12 16:37:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16402 states. [2018-11-12 16:37:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16402 states to 16402 states and 19874 transitions. [2018-11-12 16:37:52,292 INFO L78 Accepts]: Start accepts. Automaton has 16402 states and 19874 transitions. Word has length 531 [2018-11-12 16:37:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:52,294 INFO L480 AbstractCegarLoop]: Abstraction has 16402 states and 19874 transitions. [2018-11-12 16:37:52,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:37:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16402 states and 19874 transitions. [2018-11-12 16:37:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-11-12 16:37:52,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:52,310 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:37:52,311 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:52,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash -343352365, now seen corresponding path program 1 times [2018-11-12 16:37:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:52,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-12 16:37:52,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:52,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:37:52,807 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 569 with the following transitions: [2018-11-12 16:37:52,807 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [621], [622], [626], [629], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:37:52,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:37:52,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:37:52,845 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:37:55,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:37:55,012 INFO L272 AbstractInterpreter]: Visited 286 different actions 1704 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Performed 29037 root evaluator evaluations with a maximum evaluation depth of 6. Performed 29037 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 16:37:55,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:55,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:37:55,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:55,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:37:55,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:55,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:37:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:55,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:37:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-12 16:37:55,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:37:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-12 16:37:55,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:37:55,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 16:37:55,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:37:55,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:37:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:37:55,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:37:55,806 INFO L87 Difference]: Start difference. First operand 16402 states and 19874 transitions. Second operand 6 states. Received shutdown request... [2018-11-12 16:37:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 16:37:57,821 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 16:37:57,826 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 16:37:57,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:37:57 BoogieIcfgContainer [2018-11-12 16:37:57,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:37:57,827 INFO L168 Benchmark]: Toolchain (without parser) took 213752.15 ms. Allocated memory was 1.5 GB in the beginning and 5.0 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 996.8 MB in the end (delta: 429.3 MB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,829 INFO L168 Benchmark]: CDTParser took 0.22 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-12 16:37:57,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1329.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 223.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.0 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,831 INFO L168 Benchmark]: Boogie Preprocessor took 190.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,832 INFO L168 Benchmark]: RCFGBuilder took 6104.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 299.8 MB). Peak memory consumption was 299.8 MB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,833 INFO L168 Benchmark]: TraceAbstraction took 205899.23 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.8 GB). Free memory was 1.9 GB in the beginning and 996.8 MB in the end (delta: 911.0 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. [2018-11-12 16:37:57,839 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.22 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 1329.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 223.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.0 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6104.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 299.8 MB). Peak memory consumption was 299.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205899.23 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.8 GB). Free memory was 1.9 GB in the beginning and 996.8 MB in the end (delta: 911.0 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (16402states) and FLOYD_HOARE automaton (currently 9 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (7366 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 205.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 177.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4361 SDtfs, 15382 SDslu, 3085 SDs, 0 SdLazy, 29920 SolverSat, 4107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3750 GetRequests, 3548 SyntacticMatches, 70 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16402occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.9s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9976419627167616 AbsIntWeakeningRatio, 0.07627118644067797 AbsIntAvgWeakeningVarsNumRemoved, 16.05671447196871 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1801 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 5177 NumberOfCodeBlocks, 5177 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 6215 ConstructedInterpolants, 0 QuantifiedInterpolants, 5592631 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1541 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 4125/4224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown