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/Problem03_label13_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 15:26:15,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 15:26:15,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 15:26:15,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 15:26:15,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 15:26:15,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 15:26:15,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 15:26:15,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 15:26:15,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 15:26:15,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 15:26:15,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 15:26:15,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 15:26:15,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 15:26:15,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 15:26:15,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 15:26:15,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 15:26:15,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 15:26:15,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 15:26:15,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 15:26:15,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 15:26:15,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 15:26:15,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 15:26:15,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 15:26:15,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 15:26:15,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 15:26:15,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 15:26:15,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 15:26:15,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 15:26:15,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 15:26:15,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 15:26:15,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 15:26:15,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 15:26:15,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 15:26:15,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 15:26:15,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 15:26:15,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 15:26:15,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 15:26:15,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 15:26:15,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 15:26:15,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 15:26:15,235 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 15:26:15,235 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 15:26:15,236 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 15:26:15,239 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 15:26:15,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 15:26:15,240 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 15:26:15,240 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 15:26:15,240 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 15:26:15,240 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 15:26:15,240 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 15:26:15,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 15:26:15,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 15:26:15,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 15:26:15,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 15:26:15,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 15:26:15,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 15:26:15,243 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 15:26:15,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 15:26:15,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 15:26:15,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 15:26:15,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 15:26:15,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 15:26:15,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 15:26:15,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 15:26:15,245 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 15:26:15,246 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 15:26:15,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 15:26:15,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 15:26:15,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 15:26:15,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 15:26:15,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 15:26:15,320 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 15:26:15,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13_false-unreach-call.c [2018-11-12 15:26:15,390 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d4e5135/d7bf47e4f53548909d35c9915ca3ada6/FLAG7cde3673c [2018-11-12 15:26:16,048 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 15:26:16,049 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label13_false-unreach-call.c [2018-11-12 15:26:16,067 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d4e5135/d7bf47e4f53548909d35c9915ca3ada6/FLAG7cde3673c [2018-11-12 15:26:16,084 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d4e5135/d7bf47e4f53548909d35c9915ca3ada6 [2018-11-12 15:26:16,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 15:26:16,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 15:26:16,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 15:26:16,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 15:26:16,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 15:26:16,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:16" (1/1) ... [2018-11-12 15:26:16,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca715cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:16, skipping insertion in model container [2018-11-12 15:26:16,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:16" (1/1) ... [2018-11-12 15:26:16,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 15:26:16,230 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 15:26:17,019 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 15:26:17,026 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 15:26:17,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 15:26:17,404 INFO L193 MainTranslator]: Completed translation [2018-11-12 15:26:17,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17 WrapperNode [2018-11-12 15:26:17,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 15:26:17,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 15:26:17,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 15:26:17,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 15:26:17,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 15:26:17,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 15:26:17,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 15:26:17,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 15:26:17,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... [2018-11-12 15:26:17,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 15:26:17,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 15:26:17,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 15:26:17,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 15:26:17,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 15:26:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 15:26:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 15:26:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 15:26:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 15:26:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 15:26:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 15:26:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 15:26:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 15:26:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 15:26:23,427 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 15:26:23,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:23 BoogieIcfgContainer [2018-11-12 15:26:23,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 15:26:23,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 15:26:23,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 15:26:23,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 15:26:23,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:16" (1/3) ... [2018-11-12 15:26:23,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a7e5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:23, skipping insertion in model container [2018-11-12 15:26:23,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:17" (2/3) ... [2018-11-12 15:26:23,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a7e5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:23, skipping insertion in model container [2018-11-12 15:26:23,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:23" (3/3) ... [2018-11-12 15:26:23,442 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label13_false-unreach-call.c [2018-11-12 15:26:23,454 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 15:26:23,466 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 15:26:23,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 15:26:23,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 15:26:23,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 15:26:23,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 15:26:23,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 15:26:23,542 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 15:26:23,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 15:26:23,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 15:26:23,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 15:26:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-12 15:26:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-12 15:26:23,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:23,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:23,601 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:23,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1550257777, now seen corresponding path program 1 times [2018-11-12 15:26:23,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:23,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:24,587 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 15:26:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 15:26:24,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:24,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 15:26:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 15:26:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 15:26:24,816 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-11-12 15:26:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:27,274 INFO L93 Difference]: Finished difference Result 838 states and 1479 transitions. [2018-11-12 15:26:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 15:26:27,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-12 15:26:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:27,302 INFO L225 Difference]: With dead ends: 838 [2018-11-12 15:26:27,302 INFO L226 Difference]: Without dead ends: 524 [2018-11-12 15:26:27,310 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-12 15:26:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-12 15:26:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2018-11-12 15:26:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-11-12 15:26:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 890 transitions. [2018-11-12 15:26:27,409 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 890 transitions. Word has length 162 [2018-11-12 15:26:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:27,410 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 890 transitions. [2018-11-12 15:26:27,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 15:26:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 890 transitions. [2018-11-12 15:26:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-12 15:26:27,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:27,418 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:27,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:27,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:27,419 INFO L82 PathProgramCache]: Analyzing trace with hash -179109864, now seen corresponding path program 1 times [2018-11-12 15:26:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:27,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:27,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:27,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 15:26:27,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:27,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 15:26:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 15:26:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 15:26:27,759 INFO L87 Difference]: Start difference. First operand 522 states and 890 transitions. Second operand 6 states. [2018-11-12 15:26:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:31,164 INFO L93 Difference]: Finished difference Result 1581 states and 2759 transitions. [2018-11-12 15:26:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 15:26:31,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-12 15:26:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:31,177 INFO L225 Difference]: With dead ends: 1581 [2018-11-12 15:26:31,177 INFO L226 Difference]: Without dead ends: 1065 [2018-11-12 15:26:31,184 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-12 15:26:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-11-12 15:26:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1023. [2018-11-12 15:26:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-12 15:26:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1733 transitions. [2018-11-12 15:26:31,264 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1733 transitions. Word has length 172 [2018-11-12 15:26:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:31,264 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1733 transitions. [2018-11-12 15:26:31,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 15:26:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1733 transitions. [2018-11-12 15:26:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 15:26:31,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:31,269 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:31,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:31,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash 375781109, now seen corresponding path program 1 times [2018-11-12 15:26:31,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:31,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:31,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:31,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 15:26:31,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 15:26:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 15:26:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 15:26:31,571 INFO L87 Difference]: Start difference. First operand 1023 states and 1733 transitions. Second operand 3 states. [2018-11-12 15:26:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:34,208 INFO L93 Difference]: Finished difference Result 2887 states and 5063 transitions. [2018-11-12 15:26:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 15:26:34,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-12 15:26:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:34,237 INFO L225 Difference]: With dead ends: 2887 [2018-11-12 15:26:34,237 INFO L226 Difference]: Without dead ends: 1870 [2018-11-12 15:26:34,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 15:26:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-11-12 15:26:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2018-11-12 15:26:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2018-11-12 15:26:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 3055 transitions. [2018-11-12 15:26:34,327 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 3055 transitions. Word has length 175 [2018-11-12 15:26:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:34,328 INFO L480 AbstractCegarLoop]: Abstraction has 1865 states and 3055 transitions. [2018-11-12 15:26:34,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 15:26:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3055 transitions. [2018-11-12 15:26:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-12 15:26:34,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:34,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:34,338 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:34,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash -879878394, now seen corresponding path program 1 times [2018-11-12 15:26:34,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:34,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:34,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:34,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:34,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:34,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:34,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 15:26:34,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:34,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 15:26:34,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 15:26:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 15:26:34,688 INFO L87 Difference]: Start difference. First operand 1865 states and 3055 transitions. Second operand 3 states. [2018-11-12 15:26:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:36,057 INFO L93 Difference]: Finished difference Result 5412 states and 9175 transitions. [2018-11-12 15:26:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 15:26:36,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-11-12 15:26:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:36,091 INFO L225 Difference]: With dead ends: 5412 [2018-11-12 15:26:36,091 INFO L226 Difference]: Without dead ends: 3553 [2018-11-12 15:26:36,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 15:26:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2018-11-12 15:26:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3551. [2018-11-12 15:26:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2018-11-12 15:26:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 5637 transitions. [2018-11-12 15:26:36,221 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 5637 transitions. Word has length 195 [2018-11-12 15:26:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:36,223 INFO L480 AbstractCegarLoop]: Abstraction has 3551 states and 5637 transitions. [2018-11-12 15:26:36,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 15:26:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 5637 transitions. [2018-11-12 15:26:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-12 15:26:36,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:36,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:36,237 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1511937120, now seen corresponding path program 1 times [2018-11-12 15:26:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:36,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:36,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:36,488 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 15:26:36,541 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-12 15:26:36,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 15:26:36,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:36,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 15:26:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 15:26:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 15:26:36,543 INFO L87 Difference]: Start difference. First operand 3551 states and 5637 transitions. Second operand 6 states. [2018-11-12 15:26:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:38,922 INFO L93 Difference]: Finished difference Result 8962 states and 15042 transitions. [2018-11-12 15:26:38,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 15:26:38,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2018-11-12 15:26:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:38,963 INFO L225 Difference]: With dead ends: 8962 [2018-11-12 15:26:38,963 INFO L226 Difference]: Without dead ends: 5417 [2018-11-12 15:26:38,981 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-12 15:26:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2018-11-12 15:26:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5329. [2018-11-12 15:26:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5329 states. [2018-11-12 15:26:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5329 states to 5329 states and 7602 transitions. [2018-11-12 15:26:39,184 INFO L78 Accepts]: Start accepts. Automaton has 5329 states and 7602 transitions. Word has length 200 [2018-11-12 15:26:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:39,185 INFO L480 AbstractCegarLoop]: Abstraction has 5329 states and 7602 transitions. [2018-11-12 15:26:39,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 15:26:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5329 states and 7602 transitions. [2018-11-12 15:26:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-12 15:26:39,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:39,206 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:39,206 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:39,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1095155627, now seen corresponding path program 1 times [2018-11-12 15:26:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:39,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:39,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:39,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 15:26:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 15:26:39,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 15:26:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 15:26:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 15:26:39,507 INFO L87 Difference]: Start difference. First operand 5329 states and 7602 transitions. Second operand 6 states. [2018-11-12 15:26:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:26:41,353 INFO L93 Difference]: Finished difference Result 11197 states and 16329 transitions. [2018-11-12 15:26:41,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 15:26:41,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 221 [2018-11-12 15:26:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:26:41,389 INFO L225 Difference]: With dead ends: 11197 [2018-11-12 15:26:41,389 INFO L226 Difference]: Without dead ends: 5874 [2018-11-12 15:26:41,413 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-12 15:26:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2018-11-12 15:26:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 5601. [2018-11-12 15:26:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5601 states. [2018-11-12 15:26:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5601 states to 5601 states and 7541 transitions. [2018-11-12 15:26:41,632 INFO L78 Accepts]: Start accepts. Automaton has 5601 states and 7541 transitions. Word has length 221 [2018-11-12 15:26:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:26:41,633 INFO L480 AbstractCegarLoop]: Abstraction has 5601 states and 7541 transitions. [2018-11-12 15:26:41,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 15:26:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5601 states and 7541 transitions. [2018-11-12 15:26:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 15:26:41,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:26:41,657 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:26:41,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:26:41,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 986428583, now seen corresponding path program 1 times [2018-11-12 15:26:41,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:26:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:41,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:26:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:26:41,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:26:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:26:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:26:42,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:26:42,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:26:42,347 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-12 15:26:42,349 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [28], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:26:42,416 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:26:42,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:26:43,901 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 15:26:43,903 INFO L272 AbstractInterpreter]: Visited 163 different actions 163 times. Never merged. Never widened. Performed 3030 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3030 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 88 variables. [2018-11-12 15:26:43,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:26:43,943 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 15:26:45,489 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 70.67% of their original sizes. [2018-11-12 15:26:45,490 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 15:26:46,911 INFO L415 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2018-11-12 15:26:46,911 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 15:26:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 15:26:46,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-12 15:26:46,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:26:46,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 15:26:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 15:26:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-12 15:26:46,914 INFO L87 Difference]: Start difference. First operand 5601 states and 7541 transitions. Second operand 16 states. [2018-11-12 15:27:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:27:17,510 INFO L93 Difference]: Finished difference Result 11406 states and 15355 transitions. [2018-11-12 15:27:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 15:27:17,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 234 [2018-11-12 15:27:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:27:17,537 INFO L225 Difference]: With dead ends: 11406 [2018-11-12 15:27:17,537 INFO L226 Difference]: Without dead ends: 5811 [2018-11-12 15:27:17,554 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-11-12 15:27:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2018-11-12 15:27:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 5809. [2018-11-12 15:27:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5809 states. [2018-11-12 15:27:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 7758 transitions. [2018-11-12 15:27:17,693 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 7758 transitions. Word has length 234 [2018-11-12 15:27:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:27:17,694 INFO L480 AbstractCegarLoop]: Abstraction has 5809 states and 7758 transitions. [2018-11-12 15:27:17,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 15:27:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 7758 transitions. [2018-11-12 15:27:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-12 15:27:17,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:27:17,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:27:17,715 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:27:17,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:27:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -712795396, now seen corresponding path program 1 times [2018-11-12 15:27:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:27:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:27:17,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:27:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:27:17,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:27:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:27:18,344 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 15:27:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:27:18,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:27:18,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:27:18,566 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-12 15:27:18,566 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:27:18,575 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:27:18,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:27:21,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 15:27:21,263 INFO L272 AbstractInterpreter]: Visited 166 different actions 325 times. Merged at 4 different actions 4 times. Never widened. Performed 7689 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 15:27:21,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:27:21,269 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 15:27:22,909 INFO L227 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 70.63% of their original sizes. [2018-11-12 15:27:22,910 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 15:27:23,513 INFO L415 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2018-11-12 15:27:23,514 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 15:27:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 15:27:23,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-12 15:27:23,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:27:23,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 15:27:23,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 15:27:23,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-12 15:27:23,516 INFO L87 Difference]: Start difference. First operand 5809 states and 7758 transitions. Second operand 17 states. [2018-11-12 15:28:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:28:04,333 INFO L93 Difference]: Finished difference Result 14986 states and 20121 transitions. [2018-11-12 15:28:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 15:28:04,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 243 [2018-11-12 15:28:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:28:04,362 INFO L225 Difference]: With dead ends: 14986 [2018-11-12 15:28:04,362 INFO L226 Difference]: Without dead ends: 8971 [2018-11-12 15:28:04,382 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-11-12 15:28:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-12 15:28:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8915. [2018-11-12 15:28:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8915 states. [2018-11-12 15:28:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8915 states to 8915 states and 11365 transitions. [2018-11-12 15:28:04,602 INFO L78 Accepts]: Start accepts. Automaton has 8915 states and 11365 transitions. Word has length 243 [2018-11-12 15:28:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:28:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 8915 states and 11365 transitions. [2018-11-12 15:28:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 15:28:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8915 states and 11365 transitions. [2018-11-12 15:28:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 15:28:04,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:28:04,628 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:28:04,629 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:28:04,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:28:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1882485320, now seen corresponding path program 1 times [2018-11-12 15:28:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:28:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:28:04,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:28:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:28:04,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:28:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:28:05,579 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 15:28:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 102 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:28:05,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:28:05,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:28:05,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-12 15:28:05,796 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [132], [136], [139], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:28:05,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:28:05,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:28:07,301 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 15:28:07,302 INFO L272 AbstractInterpreter]: Visited 167 different actions 330 times. Merged at 5 different actions 7 times. Never widened. Performed 9134 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 15:28:07,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:28:07,310 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 15:28:08,455 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 73.62% of their original sizes. [2018-11-12 15:28:08,456 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 15:28:10,621 INFO L415 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2018-11-12 15:28:10,622 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 15:28:10,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 15:28:10,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [10] total 32 [2018-11-12 15:28:10,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:28:10,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 15:28:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 15:28:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-11-12 15:28:10,626 INFO L87 Difference]: Start difference. First operand 8915 states and 11365 transitions. Second operand 24 states. [2018-11-12 15:29:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:29:15,193 INFO L93 Difference]: Finished difference Result 18249 states and 23300 transitions. [2018-11-12 15:29:15,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 15:29:15,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 246 [2018-11-12 15:29:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:29:15,220 INFO L225 Difference]: With dead ends: 18249 [2018-11-12 15:29:15,220 INFO L226 Difference]: Without dead ends: 9548 [2018-11-12 15:29:15,237 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 202 SyntacticMatches, 21 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 15:29:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9548 states. [2018-11-12 15:29:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9548 to 9545. [2018-11-12 15:29:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9545 states. [2018-11-12 15:29:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 12045 transitions. [2018-11-12 15:29:15,433 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 12045 transitions. Word has length 246 [2018-11-12 15:29:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:29:15,433 INFO L480 AbstractCegarLoop]: Abstraction has 9545 states and 12045 transitions. [2018-11-12 15:29:15,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 15:29:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 12045 transitions. [2018-11-12 15:29:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-12 15:29:15,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:29:15,462 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-12 15:29:15,462 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:29:15,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash -894128203, now seen corresponding path program 1 times [2018-11-12 15:29:15,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:29:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:15,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:15,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:29:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:16,113 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 15:29:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 15:29:16,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:16,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:29:16,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-11-12 15:29:16,364 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:29:16,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:29:16,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:29:19,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 15:29:19,310 INFO L272 AbstractInterpreter]: Visited 168 different actions 497 times. Merged at 7 different actions 17 times. Never widened. Performed 13719 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13719 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-12 15:29:19,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:19,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 15:29:19,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:19,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 15:29:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:19,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 15:29:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:19,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 15:29:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-12 15:29:19,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 15:29:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-12 15:29:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 15:29:20,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-12 15:29:20,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:29:20,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 15:29:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 15:29:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 15:29:20,409 INFO L87 Difference]: Start difference. First operand 9545 states and 12045 transitions. Second operand 3 states. [2018-11-12 15:29:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:29:22,011 INFO L93 Difference]: Finished difference Result 25295 states and 32875 transitions. [2018-11-12 15:29:22,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 15:29:22,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-11-12 15:29:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:29:22,063 INFO L225 Difference]: With dead ends: 25295 [2018-11-12 15:29:22,064 INFO L226 Difference]: Without dead ends: 16594 [2018-11-12 15:29:22,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 15:29:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16594 states. [2018-11-12 15:29:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16594 to 16451. [2018-11-12 15:29:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16451 states. [2018-11-12 15:29:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16451 states to 16451 states and 21059 transitions. [2018-11-12 15:29:22,467 INFO L78 Accepts]: Start accepts. Automaton has 16451 states and 21059 transitions. Word has length 269 [2018-11-12 15:29:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:29:22,467 INFO L480 AbstractCegarLoop]: Abstraction has 16451 states and 21059 transitions. [2018-11-12 15:29:22,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 15:29:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 16451 states and 21059 transitions. [2018-11-12 15:29:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-12 15:29:22,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:29:22,518 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 15:29:22,518 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:29:22,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash -486605994, now seen corresponding path program 1 times [2018-11-12 15:29:22,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:29:22,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:22,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:22,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:29:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 143 proven. 22 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-12 15:29:23,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:23,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:29:23,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-11-12 15:29:23,118 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [135], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:29:23,124 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:29:23,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:29:26,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 15:29:26,078 INFO L272 AbstractInterpreter]: Visited 169 different actions 500 times. Merged at 7 different actions 17 times. Never widened. Performed 13721 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13721 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-12 15:29:26,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:26,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 15:29:26,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:26,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 15:29:26,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:26,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 15:29:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:26,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 15:29:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-12 15:29:26,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 15:29:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-12 15:29:26,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 15:29:26,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 15:29:26,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 15:29:26,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 15:29:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 15:29:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 15:29:26,753 INFO L87 Difference]: Start difference. First operand 16451 states and 21059 transitions. Second operand 9 states. [2018-11-12 15:29:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:29:29,544 INFO L93 Difference]: Finished difference Result 33010 states and 42735 transitions. [2018-11-12 15:29:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 15:29:29,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2018-11-12 15:29:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:29:29,591 INFO L225 Difference]: With dead ends: 33010 [2018-11-12 15:29:29,591 INFO L226 Difference]: Without dead ends: 17403 [2018-11-12 15:29:29,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 15:29:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2018-11-12 15:29:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 15758. [2018-11-12 15:29:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15758 states. [2018-11-12 15:29:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15758 states to 15758 states and 19104 transitions. [2018-11-12 15:29:29,933 INFO L78 Accepts]: Start accepts. Automaton has 15758 states and 19104 transitions. Word has length 273 [2018-11-12 15:29:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:29:29,933 INFO L480 AbstractCegarLoop]: Abstraction has 15758 states and 19104 transitions. [2018-11-12 15:29:29,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 15:29:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15758 states and 19104 transitions. [2018-11-12 15:29:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-12 15:29:29,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:29:29,958 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 15:29:29,959 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:29:29,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 125711121, now seen corresponding path program 1 times [2018-11-12 15:29:29,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:29:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:29,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:29,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:29:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:30,686 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 15:29:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 15:29:30,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:30,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:29:30,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-11-12 15:29:30,981 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [315], [318], [322], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:29:30,987 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:29:30,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:29:39,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 15:29:39,950 INFO L272 AbstractInterpreter]: Visited 170 different actions 1345 times. Merged at 8 different actions 68 times. Widened at 1 different actions 4 times. Performed 36202 root evaluator evaluations with a maximum evaluation depth of 6. Performed 36202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-12 15:29:39,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:39,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 15:29:39,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:39,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 15:29:39,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:39,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 15:29:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:40,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 15:29:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 135 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-12 15:29:40,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 15:29:40,747 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-11-12 15:29:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 137 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 15:29:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 15:29:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-11-12 15:29:41,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 15:29:41,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 15:29:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 15:29:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-12 15:29:41,012 INFO L87 Difference]: Start difference. First operand 15758 states and 19104 transitions. Second operand 10 states. [2018-11-12 15:29:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 15:29:50,258 INFO L93 Difference]: Finished difference Result 51954 states and 68424 transitions. [2018-11-12 15:29:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-12 15:29:50,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2018-11-12 15:29:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 15:29:50,454 INFO L225 Difference]: With dead ends: 51954 [2018-11-12 15:29:50,455 INFO L226 Difference]: Without dead ends: 36119 [2018-11-12 15:29:50,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 620 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=886, Invalid=3944, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 15:29:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36119 states. [2018-11-12 15:29:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36119 to 32754. [2018-11-12 15:29:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32754 states. [2018-11-12 15:29:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32754 states to 32754 states and 39514 transitions. [2018-11-12 15:29:51,823 INFO L78 Accepts]: Start accepts. Automaton has 32754 states and 39514 transitions. Word has length 288 [2018-11-12 15:29:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 15:29:51,824 INFO L480 AbstractCegarLoop]: Abstraction has 32754 states and 39514 transitions. [2018-11-12 15:29:51,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 15:29:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32754 states and 39514 transitions. [2018-11-12 15:29:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-12 15:29:51,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 15:29:51,864 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, 2, 2, 2, 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] [2018-11-12 15:29:51,864 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 15:29:51,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 93397446, now seen corresponding path program 1 times [2018-11-12 15:29:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 15:29:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:51,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 15:29:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 15:29:51,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 15:29:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 15:29:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 15:29:52,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 15:29:52,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 15:29:52,312 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-11-12 15:29:52,313 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [135], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [757], [759], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 15:29:52,317 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 15:29:52,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 15:29:54,457 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 15:29:54,457 INFO L272 AbstractInterpreter]: Visited 166 different actions 497 times. Merged at 7 different actions 21 times. Never widened. Performed 10639 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10639 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-12 15:29:54,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 15:29:54,465 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 15:29:56,099 INFO L227 lantSequenceWeakener]: Weakened 298 states. On average, predicates are now at 70.45% of their original sizes. [2018-11-12 15:29:56,100 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 15:29:56,368 INFO L415 sIntCurrentIteration]: We unified 300 AI predicates to 300 [2018-11-12 15:29:56,368 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 15:29:56,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 15:29:56,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 15:29:56,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 15:29:56,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 15:29:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 15:29:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-12 15:29:56,371 INFO L87 Difference]: Start difference. First operand 32754 states and 39514 transitions. Second operand 18 states. Received shutdown request... [2018-11-12 15:30:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 15:30:06,330 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 15:30:06,338 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 15:30:06,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:30:06 BoogieIcfgContainer [2018-11-12 15:30:06,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 15:30:06,339 INFO L168 Benchmark]: Toolchain (without parser) took 230241.61 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 15:30:06,340 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 15:30:06,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1304.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-11-12 15:30:06,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -900.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-11-12 15:30:06,343 INFO L168 Benchmark]: Boogie Preprocessor took 140.81 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-12 15:30:06,343 INFO L168 Benchmark]: RCFGBuilder took 5668.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. [2018-11-12 15:30:06,344 INFO L168 Benchmark]: TraceAbstraction took 222905.63 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 468.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 15:30:06,349 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1304.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 216.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -900.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.81 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 5668.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222905.63 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 468.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1500]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1500). Cancelled while BasicCegarLoop was constructing difference of abstraction (32754states) and FLOYD_HOARE automaton (currently 8 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (373 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 222.8s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 174.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3305 SDtfs, 16524 SDslu, 3533 SDs, 0 SdLazy, 23993 SolverSat, 3287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2887 GetRequests, 2648 SyntacticMatches, 34 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2250 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32754occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 22.8s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9990976077523166 AbsIntWeakeningRatio, 0.246078431372549 AbsIntAvgWeakeningVarsNumRemoved, 58.38137254901961 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 5626 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3809 NumberOfCodeBlocks, 3809 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4620 ConstructedInterpolants, 0 QuantifiedInterpolants, 3162534 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3899 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 2156/2261 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown