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_label55_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:48:02,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:48:02,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:48:02,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:48:02,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:48:02,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:48:02,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:48:02,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:48:02,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:48:02,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:48:02,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:48:02,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:48:02,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:48:02,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:48:02,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:48:02,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:48:02,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:48:02,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:48:02,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:48:02,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:48:02,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:48:02,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:48:02,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:48:02,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:48:02,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:48:02,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:48:02,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:48:02,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:48:02,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:48:02,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:48:02,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:48:02,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:48:02,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:48:02,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:48:02,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:48:02,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:48:02,075 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:48:02,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:48:02,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:48:02,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:48:02,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:48:02,109 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:48:02,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:48:02,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:48:02,111 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:48:02,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:48:02,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:48:02,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:48:02,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:48:02,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:48:02,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:48:02,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:48:02,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:48:02,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:48:02,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:48:02,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:48:02,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:48:02,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:48:02,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:48:02,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:48:02,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:48:02,117 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:48:02,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:48:02,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:48:02,119 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:48:02,119 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:48:02,119 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:48:02,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:48:02,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:48:02,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:48:02,188 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:48:02,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:48:02,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label55_true-unreach-call.c [2018-11-07 20:48:02,266 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075e1a09d/3ac80c41c78a4c449b9e64cc49d52022/FLAGdebd818d1 [2018-11-07 20:48:02,946 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:48:02,947 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label55_true-unreach-call.c [2018-11-07 20:48:02,973 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075e1a09d/3ac80c41c78a4c449b9e64cc49d52022/FLAGdebd818d1 [2018-11-07 20:48:02,991 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075e1a09d/3ac80c41c78a4c449b9e64cc49d52022 [2018-11-07 20:48:03,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:48:03,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:48:03,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:48:03,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:48:03,013 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:48:03,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:48:02" (1/1) ... [2018-11-07 20:48:03,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5342db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:03, skipping insertion in model container [2018-11-07 20:48:03,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:48:02" (1/1) ... [2018-11-07 20:48:03,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:48:03,145 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:48:03,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:48:03,981 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:48:04,280 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:48:04,303 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:48:04,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04 WrapperNode [2018-11-07 20:48:04,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:48:04,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:48:04,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:48:04,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:48:04,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:48:04,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:48:04,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:48:04,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:48:04,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... [2018-11-07 20:48:04,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:48:04,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:48:04,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:48:04,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:48:04,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:48:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:48:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:48:04,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:48:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:48:04,809 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:48:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:48:04,809 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:48:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:48:04,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:48:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:48:04,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:48:11,927 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:48:11,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:48:11 BoogieIcfgContainer [2018-11-07 20:48:11,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:48:11,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:48:11,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:48:11,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:48:11,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:48:02" (1/3) ... [2018-11-07 20:48:11,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e665c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:48:11, skipping insertion in model container [2018-11-07 20:48:11,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:48:04" (2/3) ... [2018-11-07 20:48:11,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e665c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:48:11, skipping insertion in model container [2018-11-07 20:48:11,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:48:11" (3/3) ... [2018-11-07 20:48:11,939 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55_true-unreach-call.c [2018-11-07 20:48:11,950 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:48:11,962 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:48:11,981 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:48:12,030 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:48:12,030 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:48:12,030 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:48:12,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:48:12,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:48:12,031 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:48:12,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:48:12,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:48:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-07 20:48:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 20:48:12,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:48:12,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:48:12,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:48:12,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:48:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 999091244, now seen corresponding path program 1 times [2018-11-07 20:48:12,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:48:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:48:12,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:12,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:48:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:48:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:48:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:48:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:48:12,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:48:12,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:48:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:48:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:48:12,684 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-11-07 20:48:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:48:19,004 INFO L93 Difference]: Finished difference Result 1501 states and 2761 transitions. [2018-11-07 20:48:19,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:48:19,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-07 20:48:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:48:19,031 INFO L225 Difference]: With dead ends: 1501 [2018-11-07 20:48:19,031 INFO L226 Difference]: Without dead ends: 1057 [2018-11-07 20:48:19,042 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-07 20:48:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-11-07 20:48:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 744. [2018-11-07 20:48:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-07 20:48:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1125 transitions. [2018-11-07 20:48:19,156 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1125 transitions. Word has length 64 [2018-11-07 20:48:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:48:19,157 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1125 transitions. [2018-11-07 20:48:19,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:48:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1125 transitions. [2018-11-07 20:48:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 20:48:19,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:48:19,165 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:48:19,166 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:48:19,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:48:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 156166359, now seen corresponding path program 1 times [2018-11-07 20:48:19,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:48:19,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:19,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:48:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:19,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:48:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:48:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:48:19,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:48:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:48:19,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:48:19,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:48:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:48:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:48:19,440 INFO L87 Difference]: Start difference. First operand 744 states and 1125 transitions. Second operand 4 states. [2018-11-07 20:48:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:48:24,959 INFO L93 Difference]: Finished difference Result 2730 states and 4237 transitions. [2018-11-07 20:48:24,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:48:24,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-07 20:48:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:48:24,982 INFO L225 Difference]: With dead ends: 2730 [2018-11-07 20:48:24,983 INFO L226 Difference]: Without dead ends: 1992 [2018-11-07 20:48:24,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:48:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2018-11-07 20:48:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2018-11-07 20:48:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2018-11-07 20:48:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2757 transitions. [2018-11-07 20:48:25,094 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2757 transitions. Word has length 134 [2018-11-07 20:48:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:48:25,097 INFO L480 AbstractCegarLoop]: Abstraction has 1990 states and 2757 transitions. [2018-11-07 20:48:25,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:48:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2757 transitions. [2018-11-07 20:48:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-07 20:48:25,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:48:25,113 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:48:25,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:48:25,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:48:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1914840421, now seen corresponding path program 1 times [2018-11-07 20:48:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:48:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:48:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:48:25,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:48:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:48:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 117 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 20:48:25,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:48:25,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:48:25,606 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-11-07 20:48:25,610 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [613], [614], [618], [622], [626], [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-07 20:48:25,662 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:48:25,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:48:26,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:48:27,510 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:48:27,512 INFO L272 AbstractInterpreter]: Visited 104 different actions 692 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:48:27,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:48:27,572 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:48:28,328 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 77.8% of their original sizes. [2018-11-07 20:48:28,328 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:48:31,712 INFO L415 sIntCurrentIteration]: We unified 239 AI predicates to 239 [2018-11-07 20:48:31,712 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:48:31,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:48:31,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 20:48:31,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:48:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:48:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:48:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:48:31,716 INFO L87 Difference]: Start difference. First operand 1990 states and 2757 transitions. Second operand 18 states. [2018-11-07 20:49:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:49:27,217 INFO L93 Difference]: Finished difference Result 5757 states and 7609 transitions. [2018-11-07 20:49:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:49:27,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 240 [2018-11-07 20:49:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:49:27,236 INFO L225 Difference]: With dead ends: 5757 [2018-11-07 20:49:27,236 INFO L226 Difference]: Without dead ends: 3773 [2018-11-07 20:49:27,246 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 175 SyntacticMatches, 48 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:49:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2018-11-07 20:49:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3240. [2018-11-07 20:49:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3240 states. [2018-11-07 20:49:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4054 transitions. [2018-11-07 20:49:27,333 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4054 transitions. Word has length 240 [2018-11-07 20:49:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:49:27,334 INFO L480 AbstractCegarLoop]: Abstraction has 3240 states and 4054 transitions. [2018-11-07 20:49:27,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:49:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4054 transitions. [2018-11-07 20:49:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-07 20:49:27,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:49:27,344 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:49:27,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:49:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:49:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 383237176, now seen corresponding path program 1 times [2018-11-07 20:49:27,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:49:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:49:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:49:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:49:27,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:49:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:49:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 20:49:27,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:49:27,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:49:27,778 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:49:27,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:49:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:49:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:49:27,779 INFO L87 Difference]: Start difference. First operand 3240 states and 4054 transitions. Second operand 5 states. [2018-11-07 20:49:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:49:32,066 INFO L93 Difference]: Finished difference Result 7209 states and 9618 transitions. [2018-11-07 20:49:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 20:49:32,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 382 [2018-11-07 20:49:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:49:32,097 INFO L225 Difference]: With dead ends: 7209 [2018-11-07 20:49:32,097 INFO L226 Difference]: Without dead ends: 5225 [2018-11-07 20:49:32,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:49:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2018-11-07 20:49:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 5196. [2018-11-07 20:49:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5196 states. [2018-11-07 20:49:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 6411 transitions. [2018-11-07 20:49:32,238 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 6411 transitions. Word has length 382 [2018-11-07 20:49:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:49:32,239 INFO L480 AbstractCegarLoop]: Abstraction has 5196 states and 6411 transitions. [2018-11-07 20:49:32,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:49:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 6411 transitions. [2018-11-07 20:49:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-11-07 20:49:32,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:49:32,255 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-11-07 20:49:32,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:49:32,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:49:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2011145772, now seen corresponding path program 1 times [2018-11-07 20:49:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:49:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:49:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:49:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:49:32,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:49:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:49:32,740 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:49:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 251 proven. 86 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 20:49:34,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:49:34,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:49:34,171 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 501 with the following transitions: [2018-11-07 20:49:34,172 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [613], [614], [617], [618], [622], [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], [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-07 20:49:34,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:49:34,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:49:34,389 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:49:34,611 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:49:34,611 INFO L272 AbstractInterpreter]: Visited 284 different actions 562 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:49:34,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:49:34,623 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:49:35,395 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 78.08% of their original sizes. [2018-11-07 20:49:35,395 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:49:35,720 INFO L415 sIntCurrentIteration]: We unified 499 AI predicates to 499 [2018-11-07 20:49:35,720 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:49:35,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:49:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-11-07 20:49:35,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:49:35,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 20:49:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 20:49:35,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-07 20:49:35,723 INFO L87 Difference]: Start difference. First operand 5196 states and 6411 transitions. Second operand 15 states. [2018-11-07 20:50:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:50:11,230 INFO L93 Difference]: Finished difference Result 9743 states and 12237 transitions. [2018-11-07 20:50:11,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 20:50:11,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 500 [2018-11-07 20:50:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:50:11,254 INFO L225 Difference]: With dead ends: 9743 [2018-11-07 20:50:11,254 INFO L226 Difference]: Without dead ends: 5803 [2018-11-07 20:50:11,268 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 507 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:50:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2018-11-07 20:50:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5799. [2018-11-07 20:50:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5799 states. [2018-11-07 20:50:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 7060 transitions. [2018-11-07 20:50:11,403 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 7060 transitions. Word has length 500 [2018-11-07 20:50:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:50:11,404 INFO L480 AbstractCegarLoop]: Abstraction has 5799 states and 7060 transitions. [2018-11-07 20:50:11,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 20:50:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 7060 transitions. [2018-11-07 20:50:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-07 20:50:11,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:50:11,425 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:50:11,425 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:50:11,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2116246324, now seen corresponding path program 1 times [2018-11-07 20:50:11,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:50:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:11,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:11,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:50:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:11,877 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:50:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 251 proven. 117 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 20:50:12,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:50:12,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:50:12,775 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 532 with the following transitions: [2018-11-07 20:50:12,775 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [613], [614], [618], [622], [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-07 20:50:12,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:50:12,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:50:13,105 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:50:14,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:50:14,607 INFO L272 AbstractInterpreter]: Visited 285 different actions 1694 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:50:14,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:14,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:50:14,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:50:14,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:50:14,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:14,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:50:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:14,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:50:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 20:50:15,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:50:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 20:50:16,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:50:16,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 20:50:16,192 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:50:16,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:50:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:50:16,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-07 20:50:16,194 INFO L87 Difference]: Start difference. First operand 5799 states and 7060 transitions. Second operand 11 states. [2018-11-07 20:50:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:50:26,310 INFO L93 Difference]: Finished difference Result 13921 states and 17694 transitions. [2018-11-07 20:50:26,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:50:26,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 531 [2018-11-07 20:50:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:50:26,367 INFO L225 Difference]: With dead ends: 13921 [2018-11-07 20:50:26,368 INFO L226 Difference]: Without dead ends: 9378 [2018-11-07 20:50:26,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1071 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:50:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2018-11-07 20:50:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9033. [2018-11-07 20:50:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9033 states. [2018-11-07 20:50:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9033 states to 9033 states and 10204 transitions. [2018-11-07 20:50:26,635 INFO L78 Accepts]: Start accepts. Automaton has 9033 states and 10204 transitions. Word has length 531 [2018-11-07 20:50:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:50:26,636 INFO L480 AbstractCegarLoop]: Abstraction has 9033 states and 10204 transitions. [2018-11-07 20:50:26,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:50:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9033 states and 10204 transitions. [2018-11-07 20:50:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-11-07 20:50:26,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:50:26,654 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 20:50:26,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:50:26,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1690155302, now seen corresponding path program 1 times [2018-11-07 20:50:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:50:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:26,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:50:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 20:50:27,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:50:27,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:50:27,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:50:27,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:50:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:50:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:50:27,168 INFO L87 Difference]: Start difference. First operand 9033 states and 10204 transitions. Second operand 3 states. [2018-11-07 20:50:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:50:30,306 INFO L93 Difference]: Finished difference Result 16805 states and 19266 transitions. [2018-11-07 20:50:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:50:30,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2018-11-07 20:50:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:50:30,335 INFO L225 Difference]: With dead ends: 16805 [2018-11-07 20:50:30,335 INFO L226 Difference]: Without dead ends: 9340 [2018-11-07 20:50:30,352 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-07 20:50:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2018-11-07 20:50:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 9032. [2018-11-07 20:50:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9032 states. [2018-11-07 20:50:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9032 states to 9032 states and 10199 transitions. [2018-11-07 20:50:30,528 INFO L78 Accepts]: Start accepts. Automaton has 9032 states and 10199 transitions. Word has length 580 [2018-11-07 20:50:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:50:30,529 INFO L480 AbstractCegarLoop]: Abstraction has 9032 states and 10199 transitions. [2018-11-07 20:50:30,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:50:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9032 states and 10199 transitions. [2018-11-07 20:50:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-11-07 20:50:30,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:50:30,549 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:50:30,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:50:30,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1595037559, now seen corresponding path program 1 times [2018-11-07 20:50:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:50:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:30,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:30,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:50:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 462 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-07 20:50:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:50:31,337 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:50:31,337 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 602 with the following transitions: [2018-11-07 20:50:31,339 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [566], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [613], [614], [618], [622], [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-07 20:50:31,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:50:31,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:50:31,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:50:33,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:50:33,747 INFO L272 AbstractInterpreter]: Visited 286 different actions 1705 times. Merged at 9 different actions 48 times. Widened at 1 different actions 1 times. Found 14 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:50:33,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:33,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:50:33,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:50:33,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:50:33,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:33,790 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:50:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:33,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:50:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 462 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-07 20:50:34,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:50:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 462 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-07 20:50:35,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:50:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 20:50:35,228 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:50:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:50:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:50:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:50:35,231 INFO L87 Difference]: Start difference. First operand 9032 states and 10199 transitions. Second operand 7 states. [2018-11-07 20:50:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:50:39,184 INFO L93 Difference]: Finished difference Result 19665 states and 22895 transitions. [2018-11-07 20:50:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:50:39,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 601 [2018-11-07 20:50:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:50:39,224 INFO L225 Difference]: With dead ends: 19665 [2018-11-07 20:50:39,225 INFO L226 Difference]: Without dead ends: 12201 [2018-11-07 20:50:39,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:50:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12201 states. [2018-11-07 20:50:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12201 to 11201. [2018-11-07 20:50:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11201 states. [2018-11-07 20:50:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 12654 transitions. [2018-11-07 20:50:39,489 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 12654 transitions. Word has length 601 [2018-11-07 20:50:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:50:39,491 INFO L480 AbstractCegarLoop]: Abstraction has 11201 states and 12654 transitions. [2018-11-07 20:50:39,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:50:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 12654 transitions. [2018-11-07 20:50:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2018-11-07 20:50:39,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:50:39,511 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:50:39,511 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:50:39,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1580738233, now seen corresponding path program 1 times [2018-11-07 20:50:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:50:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:50:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:50:39,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:50:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:50:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 409 proven. 82 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-07 20:50:40,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:50:40,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:50:40,364 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 606 with the following transitions: [2018-11-07 20:50:40,365 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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], [633], [636], [640], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [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-07 20:50:40,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:50:40,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:50:40,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:50:41,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:50:41,812 INFO L272 AbstractInterpreter]: Visited 285 different actions 1135 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:50:41,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:50:41,819 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:50:42,514 INFO L227 lantSequenceWeakener]: Weakened 600 states. On average, predicates are now at 80.4% of their original sizes. [2018-11-07 20:50:42,514 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:50:42,604 INFO L415 sIntCurrentIteration]: We unified 604 AI predicates to 604 [2018-11-07 20:50:42,604 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:50:42,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:50:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 20:50:42,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:50:42,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:50:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:50:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:50:42,606 INFO L87 Difference]: Start difference. First operand 11201 states and 12654 transitions. Second operand 10 states. [2018-11-07 20:51:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:51:09,491 INFO L93 Difference]: Finished difference Result 22101 states and 25062 transitions. [2018-11-07 20:51:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 20:51:09,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 605 [2018-11-07 20:51:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:51:09,530 INFO L225 Difference]: With dead ends: 22101 [2018-11-07 20:51:09,530 INFO L226 Difference]: Without dead ends: 12468 [2018-11-07 20:51:09,547 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 611 GetRequests, 596 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-07 20:51:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12468 states. [2018-11-07 20:51:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12468 to 12144. [2018-11-07 20:51:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12144 states. [2018-11-07 20:51:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12144 states to 12144 states and 13673 transitions. [2018-11-07 20:51:10,669 INFO L78 Accepts]: Start accepts. Automaton has 12144 states and 13673 transitions. Word has length 605 [2018-11-07 20:51:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:51:10,670 INFO L480 AbstractCegarLoop]: Abstraction has 12144 states and 13673 transitions. [2018-11-07 20:51:10,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:51:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 12144 states and 13673 transitions. [2018-11-07 20:51:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2018-11-07 20:51:10,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:51:10,694 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:51:10,694 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:51:10,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:51:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -737266042, now seen corresponding path program 1 times [2018-11-07 20:51:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:51:10,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:51:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:10,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:51:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:51:11,229 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-07 20:51:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-07 20:51:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:51:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:51:11,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:51:11,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:51:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:51:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:51:11,461 INFO L87 Difference]: Start difference. First operand 12144 states and 13673 transitions. Second operand 4 states. [2018-11-07 20:51:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:51:16,059 INFO L93 Difference]: Finished difference Result 35212 states and 41020 transitions. [2018-11-07 20:51:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:51:16,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 626 [2018-11-07 20:51:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:51:16,117 INFO L225 Difference]: With dead ends: 35212 [2018-11-07 20:51:16,117 INFO L226 Difference]: Without dead ends: 15143 [2018-11-07 20:51:16,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-07 20:51:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2018-11-07 20:51:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14842. [2018-11-07 20:51:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14842 states. [2018-11-07 20:51:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14842 states to 14842 states and 16131 transitions. [2018-11-07 20:51:16,412 INFO L78 Accepts]: Start accepts. Automaton has 14842 states and 16131 transitions. Word has length 626 [2018-11-07 20:51:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:51:16,413 INFO L480 AbstractCegarLoop]: Abstraction has 14842 states and 16131 transitions. [2018-11-07 20:51:16,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:51:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 14842 states and 16131 transitions. [2018-11-07 20:51:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2018-11-07 20:51:16,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:51:16,444 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:51:16,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:51:16,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:51:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1254192642, now seen corresponding path program 1 times [2018-11-07 20:51:16,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:51:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:51:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:16,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:51:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:51:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 769 proven. 110 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-11-07 20:51:17,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:51:17,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:51:17,767 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 782 with the following transitions: [2018-11-07 20:51:17,767 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [613], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [660], [663], [667], [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], [994], [999], [1001], [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-07 20:51:17,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:51:17,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:51:18,016 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:51:19,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:51:19,242 INFO L272 AbstractInterpreter]: Visited 291 different actions 1728 times. Merged at 10 different actions 54 times. Widened at 1 different actions 1 times. Found 15 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:51:19,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:51:19,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:51:19,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:51:19,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:51:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:51:19,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:51:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:51:19,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:51:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-11-07 20:51:20,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:51:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-11-07 20:51:20,350 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:51:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2018-11-07 20:51:20,351 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:51:20,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:51:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:51:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:51:20,352 INFO L87 Difference]: Start difference. First operand 14842 states and 16131 transitions. Second operand 3 states. [2018-11-07 20:51:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:51:22,316 INFO L93 Difference]: Finished difference Result 32157 states and 35471 transitions. [2018-11-07 20:51:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:51:22,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 781 [2018-11-07 20:51:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:51:22,361 INFO L225 Difference]: With dead ends: 32157 [2018-11-07 20:51:22,361 INFO L226 Difference]: Without dead ends: 18874 [2018-11-07 20:51:22,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1570 GetRequests, 1564 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:51:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18874 states. [2018-11-07 20:51:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18874 to 17334. [2018-11-07 20:51:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17334 states. [2018-11-07 20:51:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17334 states to 17334 states and 19128 transitions. [2018-11-07 20:51:22,660 INFO L78 Accepts]: Start accepts. Automaton has 17334 states and 19128 transitions. Word has length 781 [2018-11-07 20:51:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:51:22,662 INFO L480 AbstractCegarLoop]: Abstraction has 17334 states and 19128 transitions. [2018-11-07 20:51:22,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:51:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17334 states and 19128 transitions. [2018-11-07 20:51:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-11-07 20:51:22,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:51:22,697 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:51:22,697 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:51:22,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:51:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1847700403, now seen corresponding path program 1 times [2018-11-07 20:51:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:51:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:51:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:51:22,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:51:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:51:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2018-11-07 20:51:23,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:51:23,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:51:23,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:51:23,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:51:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:51:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:51:23,772 INFO L87 Difference]: Start difference. First operand 17334 states and 19128 transitions. Second operand 4 states. [2018-11-07 20:51:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:51:27,883 INFO L93 Difference]: Finished difference Result 53950 states and 60576 transitions. [2018-11-07 20:51:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:51:27,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 786 [2018-11-07 20:51:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:51:27,893 INFO L225 Difference]: With dead ends: 53950 [2018-11-07 20:51:27,893 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:51:27,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:51:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:51:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:51:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:51:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:51:27,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 786 [2018-11-07 20:51:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:51:27,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:51:27,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:51:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:51:27,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:51:27,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:51:28,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,844 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 137 [2018-11-07 20:51:28,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:28,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,216 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 137 [2018-11-07 20:51:29,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:51:29,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. Received shutdown request... [2018-11-07 20:51:30,241 WARN L187 SmtUtils]: Removed 4 from assertion stack [2018-11-07 20:51:30,241 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-07 20:51:30,243 INFO L168 Benchmark]: Toolchain (without parser) took 207238.90 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.4 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 78.1 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:51:30,244 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:51:30,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1295.61 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-07 20:51:30,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 238.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:51:30,247 INFO L168 Benchmark]: Boogie Preprocessor took 191.63 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-11-07 20:51:30,249 INFO L168 Benchmark]: RCFGBuilder took 7193.58 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: 298.1 MB). Peak memory consumption was 298.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:51:30,250 INFO L168 Benchmark]: TraceAbstraction took 198311.33 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 1.9 GB in the beginning and 1.4 GB in the end (delta: 543.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:51:30,256 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.19 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 1295.61 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 238.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.63 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7193.58 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: 298.1 MB). Peak memory consumption was 298.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198311.33 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 1.9 GB in the beginning and 1.4 GB in the end (delta: 543.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 178]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 48. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown