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/Problem14_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:38:39,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:38:39,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:38:39,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:38:39,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:38:39,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:38:39,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:38:39,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:38:39,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:38:39,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:38:39,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:38:39,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:38:39,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:38:39,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:38:39,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:38:39,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:38:39,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:38:39,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:38:39,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:38:39,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:38:39,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:38:39,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:38:39,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:38:39,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:38:39,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:38:39,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:38:39,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:38:39,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:38:39,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:38:39,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:38:39,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:38:39,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:38:39,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:38:39,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:38:39,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:38:39,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:38:39,289 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:38:39,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:38:39,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:38:39,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:38:39,307 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:38:39,307 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:38:39,307 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:38:39,307 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:38:39,307 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:38:39,307 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:38:39,308 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:38:39,308 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:38:39,308 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:38:39,308 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:38:39,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:38:39,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:38:39,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:38:39,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:38:39,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:38:39,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:38:39,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:38:39,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:38:39,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:38:39,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:38:39,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:38:39,316 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:38:39,316 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:38:39,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:38:39,317 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:38:39,317 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:38:39,317 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:38:39,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:38:39,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:38:39,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:38:39,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:38:39,405 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:38:39,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2018-11-07 20:38:39,475 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7df006/acdd8ba3ce9c4fe4b9559dcc425a56c6/FLAGf01e99ce2 [2018-11-07 20:38:40,064 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:38:40,065 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2018-11-07 20:38:40,093 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7df006/acdd8ba3ce9c4fe4b9559dcc425a56c6/FLAGf01e99ce2 [2018-11-07 20:38:40,113 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7df006/acdd8ba3ce9c4fe4b9559dcc425a56c6 [2018-11-07 20:38:40,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:38:40,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:38:40,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:38:40,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:38:40,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:38:40,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:40,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f80c201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40, skipping insertion in model container [2018-11-07 20:38:40,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:40,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:38:40,225 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:38:40,760 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:38:40,766 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:38:40,945 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:38:40,964 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:38:40,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40 WrapperNode [2018-11-07 20:38:40,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:38:40,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:38:40,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:38:40,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:38:40,977 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:38:40" (1/1) ... [2018-11-07 20:38:41,103 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:38:40" (1/1) ... [2018-11-07 20:38:41,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:38:41,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:38:41,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:38:41,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:38:41,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (1/1) ... [2018-11-07 20:38:41,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:38:41,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:38:41,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:38:41,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:38:41,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (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:38:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:38:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:38:41,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:38:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:38:41,323 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:38:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:38:41,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:38:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:38:41,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:38:44,864 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:38:44,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:44 BoogieIcfgContainer [2018-11-07 20:38:44,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:38:44,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:38:44,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:38:44,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:38:44,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:38:40" (1/3) ... [2018-11-07 20:38:44,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ad28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:44, skipping insertion in model container [2018-11-07 20:38:44,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:40" (2/3) ... [2018-11-07 20:38:44,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ad28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:44, skipping insertion in model container [2018-11-07 20:38:44,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:44" (3/3) ... [2018-11-07 20:38:44,874 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label51_true-unreach-call_false-termination.c [2018-11-07 20:38:44,883 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:38:44,891 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:38:44,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:38:44,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:38:44,948 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:38:44,948 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:38:44,948 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:38:44,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:38:44,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:38:44,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:38:44,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:38:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:38:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 20:38:44,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:44,989 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] [2018-11-07 20:38:44,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:44,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 227880372, now seen corresponding path program 1 times [2018-11-07 20:38:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:45,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:45,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:45,446 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:38:45,559 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:38:45,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:45,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:38:45,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:45,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:38:45,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:38:45,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:38:45,589 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:38:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:47,435 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:38:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:38:47,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-07 20:38:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:47,459 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:38:47,459 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:38:47,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:38:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:38:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:38:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:38:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-07 20:38:47,558 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 42 [2018-11-07 20:38:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-07 20:38:47,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:38:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-07 20:38:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 20:38:47,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:47,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:47,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1420249389, now seen corresponding path program 1 times [2018-11-07 20:38:47,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:47,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:38:47,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:47,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:38:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:38:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:38:47,877 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-07 20:38:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:51,807 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-07 20:38:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:38:51,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-07 20:38:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:51,825 INFO L225 Difference]: With dead ends: 1416 [2018-11-07 20:38:51,825 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 20:38:51,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:38:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 20:38:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-07 20:38:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-07 20:38:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-07 20:38:51,893 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 119 [2018-11-07 20:38:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:51,893 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-07 20:38:51,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:38:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-07 20:38:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 20:38:51,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:51,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,905 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:51,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2006517165, now seen corresponding path program 1 times [2018-11-07 20:38:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:51,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:52,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:38:52,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:38:52,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:38:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:38:52,213 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-07 20:38:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:56,033 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-07 20:38:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:38:56,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-11-07 20:38:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:56,051 INFO L225 Difference]: With dead ends: 2347 [2018-11-07 20:38:56,051 INFO L226 Difference]: Without dead ends: 1380 [2018-11-07 20:38:56,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:38:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-07 20:38:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-07 20:38:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-07 20:38:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-07 20:38:56,128 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 183 [2018-11-07 20:38:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:56,128 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-07 20:38:56,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:38:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-07 20:38:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 20:38:56,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:56,134 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:38:56,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:56,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash -144529577, now seen corresponding path program 1 times [2018-11-07 20:38:56,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:56,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:56,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:56,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:56,643 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-07 20:38:56,645 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:56,701 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:56,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:57,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:57,222 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:57,223 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:38:57,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:57,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:57,847 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 77.85% of their original sizes. [2018-11-07 20:38:57,848 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:58,179 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-07 20:38:58,179 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:58,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-07 20:38:58,181 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:58,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:38:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:38:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:38:58,182 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-07 20:39:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:13,733 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-07 20:39:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:39:13,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2018-11-07 20:39:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:13,743 INFO L225 Difference]: With dead ends: 2883 [2018-11-07 20:39:13,743 INFO L226 Difference]: Without dead ends: 1537 [2018-11-07 20:39:13,748 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:39:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-07 20:39:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-07 20:39:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-07 20:39:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-07 20:39:13,791 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 193 [2018-11-07 20:39:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:13,791 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-07 20:39:13,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:39:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-07 20:39:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-07 20:39:13,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:13,797 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:13,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:13,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1744653080, now seen corresponding path program 1 times [2018-11-07 20:39:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:13,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:13,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 20:39:14,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:14,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:14,558 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-07 20:39:14,559 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:14,568 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:14,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:14,629 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:14,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:14,739 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:39:14,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:14,778 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:15,258 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 77.9% of their original sizes. [2018-11-07 20:39:15,258 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:16,138 INFO L415 sIntCurrentIteration]: We unified 277 AI predicates to 277 [2018-11-07 20:39:16,139 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:16,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:16,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [7] total 24 [2018-11-07 20:39:16,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:39:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:39:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:39:16,140 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 19 states. [2018-11-07 20:39:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:38,096 INFO L93 Difference]: Finished difference Result 4154 states and 5946 transitions. [2018-11-07 20:39:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 20:39:38,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 278 [2018-11-07 20:39:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:38,110 INFO L225 Difference]: With dead ends: 4154 [2018-11-07 20:39:38,111 INFO L226 Difference]: Without dead ends: 2808 [2018-11-07 20:39:38,117 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:39:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-11-07 20:39:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2292. [2018-11-07 20:39:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-07 20:39:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3120 transitions. [2018-11-07 20:39:38,187 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3120 transitions. Word has length 278 [2018-11-07 20:39:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:38,187 INFO L480 AbstractCegarLoop]: Abstraction has 2292 states and 3120 transitions. [2018-11-07 20:39:38,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:39:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3120 transitions. [2018-11-07 20:39:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-07 20:39:38,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:38,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:38,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1869911044, now seen corresponding path program 1 times [2018-11-07 20:39:38,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:38,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:38,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:38,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:38,946 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-07 20:39:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 259 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:39:39,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:39,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:39,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 305 with the following transitions: [2018-11-07 20:39:39,196 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:39,200 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:39,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:39,231 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:39,747 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:39,747 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 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:39:39,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:39,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:40,086 INFO L227 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 78.16% of their original sizes. [2018-11-07 20:39:40,086 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:40,441 INFO L415 sIntCurrentIteration]: We unified 303 AI predicates to 303 [2018-11-07 20:39:40,441 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:40,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:40,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-07 20:39:40,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:39:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:39:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:39:40,444 INFO L87 Difference]: Start difference. First operand 2292 states and 3120 transitions. Second operand 18 states. [2018-11-07 20:39:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:51,257 INFO L93 Difference]: Finished difference Result 4011 states and 5700 transitions. [2018-11-07 20:39:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:39:51,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 304 [2018-11-07 20:39:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:51,269 INFO L225 Difference]: With dead ends: 4011 [2018-11-07 20:39:51,269 INFO L226 Difference]: Without dead ends: 2665 [2018-11-07 20:39:51,276 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 323 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:39:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2018-11-07 20:39:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2660. [2018-11-07 20:39:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-11-07 20:39:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3517 transitions. [2018-11-07 20:39:51,345 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3517 transitions. Word has length 304 [2018-11-07 20:39:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:51,345 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 3517 transitions. [2018-11-07 20:39:51,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:39:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3517 transitions. [2018-11-07 20:39:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 20:39:51,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:51,353 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,354 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:51,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash 682960880, now seen corresponding path program 1 times [2018-11-07 20:39:51,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:51,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:51,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:51,811 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:52,007 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:39:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 182 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:52,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:52,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:52,519 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-11-07 20:39:52,519 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:52,524 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:52,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:52,562 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:52,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:52,702 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:39:52,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:52,706 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:53,059 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 77.95% of their original sizes. [2018-11-07 20:39:53,059 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:54,020 INFO L415 sIntCurrentIteration]: We unified 313 AI predicates to 313 [2018-11-07 20:39:54,021 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:54,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:54,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [13] total 29 [2018-11-07 20:39:54,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:54,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:39:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:39:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:39:54,023 INFO L87 Difference]: Start difference. First operand 2660 states and 3517 transitions. Second operand 18 states. [2018-11-07 20:40:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:15,978 INFO L93 Difference]: Finished difference Result 4982 states and 6814 transitions. [2018-11-07 20:40:15,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 20:40:15,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 314 [2018-11-07 20:40:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:15,992 INFO L225 Difference]: With dead ends: 4982 [2018-11-07 20:40:15,992 INFO L226 Difference]: Without dead ends: 3636 [2018-11-07 20:40:15,998 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:40:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2018-11-07 20:40:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3052. [2018-11-07 20:40:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3052 states. [2018-11-07 20:40:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 3933 transitions. [2018-11-07 20:40:16,074 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 3933 transitions. Word has length 314 [2018-11-07 20:40:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:16,077 INFO L480 AbstractCegarLoop]: Abstraction has 3052 states and 3933 transitions. [2018-11-07 20:40:16,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:40:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 3933 transitions. [2018-11-07 20:40:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-07 20:40:16,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:16,087 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:16,087 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:16,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 448374763, now seen corresponding path program 1 times [2018-11-07 20:40:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:16,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:16,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:16,551 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:40:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 182 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:40:17,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:17,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:17,004 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-07 20:40:17,006 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:40:17,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:17,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:17,080 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:17,441 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:17,441 INFO L272 AbstractInterpreter]: Visited 155 different actions 306 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:40:17,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:17,467 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:17,998 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 78% of their original sizes. [2018-11-07 20:40:17,998 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:18,654 INFO L415 sIntCurrentIteration]: We unified 338 AI predicates to 338 [2018-11-07 20:40:18,654 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:18,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2018-11-07 20:40:18,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:18,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:40:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:40:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:40:18,656 INFO L87 Difference]: Start difference. First operand 3052 states and 3933 transitions. Second operand 17 states. [2018-11-07 20:40:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:42,722 INFO L93 Difference]: Finished difference Result 5371 states and 7229 transitions. [2018-11-07 20:40:42,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:40:42,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 339 [2018-11-07 20:40:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:42,737 INFO L225 Difference]: With dead ends: 5371 [2018-11-07 20:40:42,737 INFO L226 Difference]: Without dead ends: 4025 [2018-11-07 20:40:42,743 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 346 GetRequests, 317 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:40:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-11-07 20:40:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3440. [2018-11-07 20:40:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-11-07 20:40:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4347 transitions. [2018-11-07 20:40:42,835 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4347 transitions. Word has length 339 [2018-11-07 20:40:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:42,836 INFO L480 AbstractCegarLoop]: Abstraction has 3440 states and 4347 transitions. [2018-11-07 20:40:42,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:40:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4347 transitions. [2018-11-07 20:40:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-07 20:40:42,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:42,847 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:40:42,847 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:42,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash -982124028, now seen corresponding path program 1 times [2018-11-07 20:40:42,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:42,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:42,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 260 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:40:43,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:43,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:43,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 341 with the following transitions: [2018-11-07 20:40:43,396 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:40:43,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:43,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:43,515 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:44,106 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:44,106 INFO L272 AbstractInterpreter]: Visited 120 different actions 359 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:40:44,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:44,107 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:44,404 INFO L227 lantSequenceWeakener]: Weakened 337 states. On average, predicates are now at 80.36% of their original sizes. [2018-11-07 20:40:44,404 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:44,522 INFO L415 sIntCurrentIteration]: We unified 339 AI predicates to 339 [2018-11-07 20:40:44,522 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:44,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:44,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 20:40:44,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:44,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:40:44,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:40:44,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:40:44,524 INFO L87 Difference]: Start difference. First operand 3440 states and 4347 transitions. Second operand 10 states. [2018-11-07 20:40:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:49,982 INFO L93 Difference]: Finished difference Result 5378 states and 7399 transitions. [2018-11-07 20:40:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:40:49,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 340 [2018-11-07 20:40:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:49,997 INFO L225 Difference]: With dead ends: 5378 [2018-11-07 20:40:49,998 INFO L226 Difference]: Without dead ends: 4032 [2018-11-07 20:40:50,004 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 347 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:40:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2018-11-07 20:40:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3809. [2018-11-07 20:40:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2018-11-07 20:40:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4808 transitions. [2018-11-07 20:40:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4808 transitions. Word has length 340 [2018-11-07 20:40:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:50,093 INFO L480 AbstractCegarLoop]: Abstraction has 3809 states and 4808 transitions. [2018-11-07 20:40:50,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:40:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4808 transitions. [2018-11-07 20:40:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-07 20:40:50,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:50,108 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:50,108 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:50,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash -726193805, now seen corresponding path program 1 times [2018-11-07 20:40:50,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:50,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 192 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:40:51,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:51,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:51,561 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2018-11-07 20:40:51,561 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:40:51,565 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:51,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:51,621 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:51,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:51,759 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:40:51,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:51,769 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:52,161 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 77.4% of their original sizes. [2018-11-07 20:40:52,161 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:52,668 INFO L415 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2018-11-07 20:40:52,669 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:52,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:52,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [12] total 32 [2018-11-07 20:40:52,669 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:52,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 20:40:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 20:40:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-07 20:40:52,671 INFO L87 Difference]: Start difference. First operand 3809 states and 4808 transitions. Second operand 22 states. [2018-11-07 20:41:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:14,987 INFO L93 Difference]: Finished difference Result 6620 states and 8717 transitions. [2018-11-07 20:41:14,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 20:41:14,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 409 [2018-11-07 20:41:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:15,000 INFO L225 Difference]: With dead ends: 6620 [2018-11-07 20:41:15,000 INFO L226 Difference]: Without dead ends: 4905 [2018-11-07 20:41:15,005 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 417 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:41:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2018-11-07 20:41:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4197. [2018-11-07 20:41:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4197 states. [2018-11-07 20:41:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5221 transitions. [2018-11-07 20:41:15,088 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5221 transitions. Word has length 409 [2018-11-07 20:41:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:15,089 INFO L480 AbstractCegarLoop]: Abstraction has 4197 states and 5221 transitions. [2018-11-07 20:41:15,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 20:41:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5221 transitions. [2018-11-07 20:41:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-11-07 20:41:15,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:15,106 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:15,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -51837413, now seen corresponding path program 1 times [2018-11-07 20:41:15,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:15,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:15,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:15,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:15,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:15,557 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:41:15,760 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:41:15,992 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:41:16,477 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 20:41:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 180 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:41:17,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:17,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:17,182 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 422 with the following transitions: [2018-11-07 20:41:17,182 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:41:17,185 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:17,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:17,241 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:17,438 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:41:17,438 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:41:17,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:17,442 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:41:17,965 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 77.49% of their original sizes. [2018-11-07 20:41:17,965 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:41:18,345 INFO L415 sIntCurrentIteration]: We unified 420 AI predicates to 420 [2018-11-07 20:41:18,345 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:41:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:41:18,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-07 20:41:18,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:41:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:41:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:41:18,348 INFO L87 Difference]: Start difference. First operand 4197 states and 5221 transitions. Second operand 18 states. [2018-11-07 20:41:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:43,854 INFO L93 Difference]: Finished difference Result 6885 states and 8982 transitions. [2018-11-07 20:41:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:41:43,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 421 [2018-11-07 20:41:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:43,867 INFO L225 Difference]: With dead ends: 6885 [2018-11-07 20:41:43,867 INFO L226 Difference]: Without dead ends: 5170 [2018-11-07 20:41:43,873 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 428 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-11-07 20:41:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2018-11-07 20:41:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 4583. [2018-11-07 20:41:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2018-11-07 20:41:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5633 transitions. [2018-11-07 20:41:43,960 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5633 transitions. Word has length 421 [2018-11-07 20:41:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:43,961 INFO L480 AbstractCegarLoop]: Abstraction has 4583 states and 5633 transitions. [2018-11-07 20:41:43,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:41:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5633 transitions. [2018-11-07 20:41:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-11-07 20:41:43,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:43,974 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:43,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1380609387, now seen corresponding path program 1 times [2018-11-07 20:41:43,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:43,976 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 20:41:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:41:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:41:44,948 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:41:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:41:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:41:44,950 INFO L87 Difference]: Start difference. First operand 4583 states and 5633 transitions. Second operand 4 states. [2018-11-07 20:41:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:46,710 INFO L93 Difference]: Finished difference Result 8969 states and 11491 transitions. [2018-11-07 20:41:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:41:46,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 443 [2018-11-07 20:41:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:46,725 INFO L225 Difference]: With dead ends: 8969 [2018-11-07 20:41:46,725 INFO L226 Difference]: Without dead ends: 5135 [2018-11-07 20:41:46,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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:41:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2018-11-07 20:41:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5135. [2018-11-07 20:41:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5135 states. [2018-11-07 20:41:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 6280 transitions. [2018-11-07 20:41:46,827 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 6280 transitions. Word has length 443 [2018-11-07 20:41:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:46,828 INFO L480 AbstractCegarLoop]: Abstraction has 5135 states and 6280 transitions. [2018-11-07 20:41:46,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:41:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 6280 transitions. [2018-11-07 20:41:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-11-07 20:41:46,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:46,843 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:41:46,844 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:46,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1575594707, now seen corresponding path program 1 times [2018-11-07 20:41:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:46,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 233 proven. 166 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-07 20:41:47,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:47,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:47,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 458 with the following transitions: [2018-11-07 20:41:47,479 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:41:47,481 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:47,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:47,576 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:47,779 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:41:47,780 INFO L272 AbstractInterpreter]: Visited 123 different actions 367 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:41:47,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:47,788 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:41:48,234 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.37% of their original sizes. [2018-11-07 20:41:48,234 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:41:48,552 INFO L415 sIntCurrentIteration]: We unified 456 AI predicates to 456 [2018-11-07 20:41:48,552 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:41:48,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:41:48,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 20:41:48,553 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:48,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:41:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:41:48,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:41:48,555 INFO L87 Difference]: Start difference. First operand 5135 states and 6280 transitions. Second operand 17 states. [2018-11-07 20:42:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:42:07,894 INFO L93 Difference]: Finished difference Result 8945 states and 11277 transitions. [2018-11-07 20:42:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 20:42:07,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 457 [2018-11-07 20:42:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:42:07,909 INFO L225 Difference]: With dead ends: 8945 [2018-11-07 20:42:07,909 INFO L226 Difference]: Without dead ends: 6541 [2018-11-07 20:42:07,915 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 468 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-07 20:42:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6541 states. [2018-11-07 20:42:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6541 to 6082. [2018-11-07 20:42:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2018-11-07 20:42:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 7317 transitions. [2018-11-07 20:42:08,023 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 7317 transitions. Word has length 457 [2018-11-07 20:42:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:42:08,024 INFO L480 AbstractCegarLoop]: Abstraction has 6082 states and 7317 transitions. [2018-11-07 20:42:08,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:42:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 7317 transitions. [2018-11-07 20:42:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-11-07 20:42:08,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:42:08,041 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:42:08,042 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:42:08,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:42:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1584865900, now seen corresponding path program 1 times [2018-11-07 20:42:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:42:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:42:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:42:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:42:08,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:42:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:42:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 251 proven. 471 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:42:09,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:42:09,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:42:09,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 461 with the following transitions: [2018-11-07 20:42:09,177 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:42:09,179 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:42:09,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:42:09,243 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:42:09,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:42:09,401 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:42:09,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:42:09,409 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:42:09,839 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 77.41% of their original sizes. [2018-11-07 20:42:09,839 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:42:10,161 INFO L415 sIntCurrentIteration]: We unified 459 AI predicates to 459 [2018-11-07 20:42:10,162 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:42:10,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:42:10,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2018-11-07 20:42:10,163 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:42:10,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:42:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:42:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:42:10,164 INFO L87 Difference]: Start difference. First operand 6082 states and 7317 transitions. Second operand 17 states. Received shutdown request... [2018-11-07 20:42:30,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 20:42:30,182 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:42:30,188 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:42:30,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:42:30 BoogieIcfgContainer [2018-11-07 20:42:30,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:42:30,189 INFO L168 Benchmark]: Toolchain (without parser) took 230064.18 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 971.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:30,190 INFO L168 Benchmark]: CDTParser took 0.21 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:42:30,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:30,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:30,193 INFO L168 Benchmark]: Boogie Preprocessor took 127.65 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:42:30,193 INFO L168 Benchmark]: RCFGBuilder took 3620.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.0 MB). Peak memory consumption was 130.0 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:30,194 INFO L168 Benchmark]: TraceAbstraction took 225321.78 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 875.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:30,199 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.21 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 838.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 149.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.65 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3620.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.0 MB). Peak memory consumption was 130.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225321.78 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 875.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 109). Cancelled while BasicCegarLoop was constructing difference of abstraction (6082states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5399 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 225.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 198.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2680 SDtfs, 30173 SDslu, 2636 SDs, 0 SdLazy, 34435 SolverSat, 3189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.2s Time, PredicateUnifierStatistics: 20 DeclaredPredicates, 3633 GetRequests, 3363 SyntacticMatches, 15 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6082occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 10 AbstIntIterations, 10 AbstIntStrong, 0.9970929069189813 AbsIntWeakeningRatio, 0.09300998573466476 AbsIntAvgWeakeningVarsNumRemoved, 14.970898716119828 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3712 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 4302 NumberOfCodeBlocks, 4302 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9953224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 3166/4600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown