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-EXP.epf -i ../../../trunk/examples/svcomp/loops/n.c24_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:25:19,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:25:19,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:25:19,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:25:19,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:25:19,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:25:19,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:25:19,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:25:19,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:25:19,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:25:19,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:25:19,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:25:19,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:25:19,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:25:19,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:25:19,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:25:19,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:25:19,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:25:19,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:25:19,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:25:19,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:25:19,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:25:19,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:25:19,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:25:19,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:25:19,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:25:19,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:25:19,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:25:19,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:25:19,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:25:19,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:25:19,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:25:19,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:25:19,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:25:19,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:25:19,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:25:19,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:25:19,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:25:19,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:25:19,120 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:25:19,120 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:25:19,120 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:25:19,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:25:19,121 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:25:19,121 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:25:19,121 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:25:19,122 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:25:19,122 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:25:19,122 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:25:19,122 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:25:19,122 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:25:19,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:25:19,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:25:19,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:25:19,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:25:19,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:25:19,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:25:19,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:25:19,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:25:19,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:25:19,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:25:19,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:25:19,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:25:19,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:25:19,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:25:19,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:25:19,128 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:25:19,128 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:25:19,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:25:19,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:25:19,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:25:19,129 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:25:19,129 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:25:19,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:25:19,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:25:19,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:25:19,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:25:19,225 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:25:19,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c24_false-unreach-call.i [2018-11-07 10:25:19,300 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78bc332e1/56a3848fa07d4c10aa078ea7b2709863/FLAG61730a0b9 [2018-11-07 10:25:19,760 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:25:19,761 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c24_false-unreach-call.i [2018-11-07 10:25:19,771 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78bc332e1/56a3848fa07d4c10aa078ea7b2709863/FLAG61730a0b9 [2018-11-07 10:25:19,786 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78bc332e1/56a3848fa07d4c10aa078ea7b2709863 [2018-11-07 10:25:19,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:25:19,798 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:25:19,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:19,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:25:19,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:25:19,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:19" (1/1) ... [2018-11-07 10:25:19,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742dc63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:19, skipping insertion in model container [2018-11-07 10:25:19,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:19" (1/1) ... [2018-11-07 10:25:19,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:25:19,851 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:25:20,096 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:20,106 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:25:20,164 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:20,198 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:25:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20 WrapperNode [2018-11-07 10:25:20,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:20,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:20,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:25:20,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:25:20,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:20,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:25:20,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:25:20,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:25:20,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... [2018-11-07 10:25:20,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:25:20,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:25:20,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:25:20,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:25:20,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:25:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:25:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:25:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2018-11-07 10:25:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2018-11-07 10:25:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:25:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:25:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:25:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:25:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:25:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-07 10:25:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-07 10:25:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:25:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-07 10:25:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-07 10:25:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:25:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:25:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:25:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:25:21,049 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:25:21,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:21 BoogieIcfgContainer [2018-11-07 10:25:21,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:25:21,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:25:21,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:25:21,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:25:21,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:25:19" (1/3) ... [2018-11-07 10:25:21,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3b8383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:21, skipping insertion in model container [2018-11-07 10:25:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:20" (2/3) ... [2018-11-07 10:25:21,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3b8383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:21, skipping insertion in model container [2018-11-07 10:25:21,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:21" (3/3) ... [2018-11-07 10:25:21,060 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c24_false-unreach-call.i [2018-11-07 10:25:21,070 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:25:21,079 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:25:21,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:25:21,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:25:21,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:25:21,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:25:21,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:25:21,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:25:21,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:25:21,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:25:21,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:25:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-11-07 10:25:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:25:21,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:21,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:21,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:21,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 450221827, now seen corresponding path program 1 times [2018-11-07 10:25:21,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:25:21,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:25:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:25:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:25:21,333 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-11-07 10:25:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:21,366 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2018-11-07 10:25:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:25:21,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 10:25:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:21,379 INFO L225 Difference]: With dead ends: 155 [2018-11-07 10:25:21,380 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 10:25:21,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:25:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 10:25:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-07 10:25:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 10:25:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-07 10:25:21,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 17 [2018-11-07 10:25:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:21,431 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-07 10:25:21,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:25:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-07 10:25:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:25:21,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:21,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:21,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:21,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:21,433 INFO L82 PathProgramCache]: Analyzing trace with hash -14559774, now seen corresponding path program 1 times [2018-11-07 10:25:21,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:21,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:21,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:25:21,538 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:21,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:25:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:25:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:21,541 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 3 states. [2018-11-07 10:25:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:21,732 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-11-07 10:25:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:25:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 10:25:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:21,734 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:25:21,735 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 10:25:21,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 10:25:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2018-11-07 10:25:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:25:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-07 10:25:21,752 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 19 [2018-11-07 10:25:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:21,753 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-07 10:25:21,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:25:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-07 10:25:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:25:21,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:21,754 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:25:21,755 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:21,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -432499953, now seen corresponding path program 1 times [2018-11-07 10:25:21,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:21,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:25:21,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:21,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:21,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 10:25:21,921 INFO L202 CegarAbsIntRunner]: [2], [3], [21], [22], [23], [24], [25], [29], [32], [34], [35], [36], [38], [42], [46], [49], [51], [59], [67], [71], [74], [139], [150], [153], [155], [161], [162], [163], [171] [2018-11-07 10:25:21,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:21,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:22,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:22,281 INFO L272 AbstractInterpreter]: Visited 29 different actions 57 times. Merged at 12 different actions 24 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 25 variables. [2018-11-07 10:25:22,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:22,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:22,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:22,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:22,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:22,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:22,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:25:22,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:25:22,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:22,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 10:25:22,501 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:22,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:25:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:25:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:25:22,503 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 5 states. [2018-11-07 10:25:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:22,869 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2018-11-07 10:25:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:22,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-07 10:25:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:22,874 INFO L225 Difference]: With dead ends: 175 [2018-11-07 10:25:22,875 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 10:25:22,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:25:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 10:25:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2018-11-07 10:25:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 10:25:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-11-07 10:25:22,891 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 31 [2018-11-07 10:25:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:22,892 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-07 10:25:22,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:25:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-07 10:25:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 10:25:22,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:22,895 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-07 10:25:22,895 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:22,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1524754498, now seen corresponding path program 2 times [2018-11-07 10:25:22,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:22,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:22,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:22,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:22,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 10:25:23,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:23,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:23,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:23,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:23,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:23,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:23,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:23,037 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:23,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:25:23,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:23,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 10:25:23,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 10:25:23,259 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:25:23,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 10:25:23,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:23,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:25:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:25:23,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:23,261 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 5 states. [2018-11-07 10:25:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:23,472 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2018-11-07 10:25:23,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:23,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-07 10:25:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:23,475 INFO L225 Difference]: With dead ends: 155 [2018-11-07 10:25:23,476 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 10:25:23,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:25:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 10:25:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 100. [2018-11-07 10:25:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 10:25:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-11-07 10:25:23,513 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 43 [2018-11-07 10:25:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:23,513 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-11-07 10:25:23,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:25:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-11-07 10:25:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 10:25:23,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:23,518 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-07 10:25:23,521 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:23,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash -179494359, now seen corresponding path program 1 times [2018-11-07 10:25:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:23,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:23,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:23,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:25:23,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:23,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:23,717 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-07 10:25:23,718 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [5], [6], [7], [8], [9], [21], [22], [23], [24], [25], [29], [32], [34], [35], [36], [38], [42], [46], [49], [51], [59], [67], [71], [74], [76], [78], [86], [89], [135], [139], [150], [153], [155], [161], [162], [163], [165], [166], [171] [2018-11-07 10:25:23,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:23,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:23,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:23,933 INFO L272 AbstractInterpreter]: Visited 42 different actions 128 times. Merged at 18 different actions 50 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-07 10:25:23,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:23,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:23,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:23,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:23,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:23,957 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:24,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:25:24,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:25:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 10:25:24,174 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:24,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:25:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:25:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:25:24,175 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 6 states. [2018-11-07 10:25:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:24,501 INFO L93 Difference]: Finished difference Result 249 states and 312 transitions. [2018-11-07 10:25:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:24,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-07 10:25:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:24,513 INFO L225 Difference]: With dead ends: 249 [2018-11-07 10:25:24,513 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 10:25:24,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:25:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 10:25:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2018-11-07 10:25:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 10:25:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2018-11-07 10:25:24,530 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 57 [2018-11-07 10:25:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:24,530 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2018-11-07 10:25:24,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:25:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-07 10:25:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:25:24,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:24,534 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:24,534 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:24,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash 989080022, now seen corresponding path program 2 times [2018-11-07 10:25:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:24,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:24,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:24,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 10:25:24,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:24,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:24,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:24,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:24,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:24,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:24,846 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:24,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:25:24,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:24,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:25:25,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:25:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:25,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-07 10:25:25,309 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:25,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:25:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:25:25,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:25:25,312 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand 11 states. [2018-11-07 10:25:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:26,287 INFO L93 Difference]: Finished difference Result 556 states and 738 transitions. [2018-11-07 10:25:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:25:26,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-07 10:25:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:26,292 INFO L225 Difference]: With dead ends: 556 [2018-11-07 10:25:26,292 INFO L226 Difference]: Without dead ends: 448 [2018-11-07 10:25:26,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:25:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-07 10:25:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 186. [2018-11-07 10:25:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 10:25:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2018-11-07 10:25:26,328 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 69 [2018-11-07 10:25:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:26,328 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2018-11-07 10:25:26,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:25:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2018-11-07 10:25:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 10:25:26,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:26,334 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 10:25:26,334 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:26,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1387648560, now seen corresponding path program 3 times [2018-11-07 10:25:26,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:26,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:26,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 10:25:26,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:26,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:26,497 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:26,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:26,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:26,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:26,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:25:26,507 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:25:26,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:25:26,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:26,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 10:25:26,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 10:25:27,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:27,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 10:25:27,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:27,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:25:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:25:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:25:27,244 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand 8 states. [2018-11-07 10:25:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:27,865 INFO L93 Difference]: Finished difference Result 455 states and 598 transitions. [2018-11-07 10:25:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:25:27,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-07 10:25:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:27,868 INFO L225 Difference]: With dead ends: 455 [2018-11-07 10:25:27,869 INFO L226 Difference]: Without dead ends: 301 [2018-11-07 10:25:27,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:25:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-07 10:25:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 218. [2018-11-07 10:25:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 10:25:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2018-11-07 10:25:27,893 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 95 [2018-11-07 10:25:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:27,894 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2018-11-07 10:25:27,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:25:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2018-11-07 10:25:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:25:27,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:27,897 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-07 10:25:27,897 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:27,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1410045859, now seen corresponding path program 4 times [2018-11-07 10:25:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:27,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:27,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 10:25:28,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:28,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:28,087 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:28,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:28,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:28,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:28,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:28,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:28,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 10:25:28,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 10:25:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 10:25:28,395 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:28,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:25:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:25:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:25:28,396 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand 9 states. [2018-11-07 10:25:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:28,670 INFO L93 Difference]: Finished difference Result 514 states and 677 transitions. [2018-11-07 10:25:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:25:28,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2018-11-07 10:25:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:28,674 INFO L225 Difference]: With dead ends: 514 [2018-11-07 10:25:28,674 INFO L226 Difference]: Without dead ends: 333 [2018-11-07 10:25:28,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:25:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-07 10:25:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 250. [2018-11-07 10:25:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-07 10:25:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2018-11-07 10:25:28,699 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 107 [2018-11-07 10:25:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:28,699 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2018-11-07 10:25:28,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:25:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2018-11-07 10:25:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:25:28,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:28,702 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-11-07 10:25:28,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1773521040, now seen corresponding path program 5 times [2018-11-07 10:25:28,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:28,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 10:25:28,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:28,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:28,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:28,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:28,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:28,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:28,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:28,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:28,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:25:28,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:28,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-07 10:25:29,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-07 10:25:29,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:29,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2018-11-07 10:25:29,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:29,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:25:29,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:25:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:25:29,421 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand 15 states. [2018-11-07 10:25:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:31,684 INFO L93 Difference]: Finished difference Result 1119 states and 1511 transitions. [2018-11-07 10:25:31,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:25:31,685 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 119 [2018-11-07 10:25:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:31,692 INFO L225 Difference]: With dead ends: 1119 [2018-11-07 10:25:31,692 INFO L226 Difference]: Without dead ends: 908 [2018-11-07 10:25:31,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:25:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-07 10:25:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 304. [2018-11-07 10:25:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-07 10:25:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 394 transitions. [2018-11-07 10:25:31,730 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 394 transitions. Word has length 119 [2018-11-07 10:25:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:31,730 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 394 transitions. [2018-11-07 10:25:31,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:25:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 394 transitions. [2018-11-07 10:25:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 10:25:31,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:31,733 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:31,733 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:31,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1227931300, now seen corresponding path program 6 times [2018-11-07 10:25:31,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:31,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:31,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 10:25:31,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:31,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:31,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:31,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:31,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:31,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:25:31,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:25:31,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:25:31,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:31,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 10:25:32,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 10:25:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 10:25:32,368 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:32,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:25:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:25:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:25:32,370 INFO L87 Difference]: Start difference. First operand 304 states and 394 transitions. Second operand 11 states. [2018-11-07 10:25:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:33,204 INFO L93 Difference]: Finished difference Result 720 states and 963 transitions. [2018-11-07 10:25:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:25:33,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-11-07 10:25:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:33,212 INFO L225 Difference]: With dead ends: 720 [2018-11-07 10:25:33,212 INFO L226 Difference]: Without dead ends: 463 [2018-11-07 10:25:33,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:25:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-07 10:25:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 336. [2018-11-07 10:25:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-07 10:25:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions. [2018-11-07 10:25:33,248 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 145 [2018-11-07 10:25:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:33,248 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions. [2018-11-07 10:25:33,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:25:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions. [2018-11-07 10:25:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 10:25:33,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:33,251 INFO L375 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:33,251 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:33,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1845445719, now seen corresponding path program 7 times [2018-11-07 10:25:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:33,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:33,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:33,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 10:25:33,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:33,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:33,613 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:33,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:33,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:33,614 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:33,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:33,623 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:33,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 10:25:33,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 10:25:33,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:33,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 10:25:33,996 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:33,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:25:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:25:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:25:33,998 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand 12 states. [2018-11-07 10:25:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:36,401 INFO L93 Difference]: Finished difference Result 779 states and 1042 transitions. [2018-11-07 10:25:36,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:25:36,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-11-07 10:25:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:36,405 INFO L225 Difference]: With dead ends: 779 [2018-11-07 10:25:36,405 INFO L226 Difference]: Without dead ends: 495 [2018-11-07 10:25:36,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:25:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-11-07 10:25:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 368. [2018-11-07 10:25:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-07 10:25:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 478 transitions. [2018-11-07 10:25:36,450 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 478 transitions. Word has length 157 [2018-11-07 10:25:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:36,450 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 478 transitions. [2018-11-07 10:25:36,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:25:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 478 transitions. [2018-11-07 10:25:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 10:25:36,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:36,454 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:36,454 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:36,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1305145788, now seen corresponding path program 8 times [2018-11-07 10:25:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:36,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-07 10:25:36,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:36,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:36,826 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:36,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:36,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:36,851 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:36,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:25:36,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:36,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-07 10:25:37,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-07 10:25:37,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:37,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2018-11-07 10:25:37,234 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:37,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:25:37,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:25:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:25:37,235 INFO L87 Difference]: Start difference. First operand 368 states and 478 transitions. Second operand 19 states. [2018-11-07 10:25:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:40,656 INFO L93 Difference]: Finished difference Result 1838 states and 2500 transitions. [2018-11-07 10:25:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 10:25:40,656 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169 [2018-11-07 10:25:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:40,666 INFO L225 Difference]: With dead ends: 1838 [2018-11-07 10:25:40,667 INFO L226 Difference]: Without dead ends: 1524 [2018-11-07 10:25:40,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1773, Invalid=4547, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:25:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-11-07 10:25:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 422. [2018-11-07 10:25:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-07 10:25:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2018-11-07 10:25:40,736 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 169 [2018-11-07 10:25:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2018-11-07 10:25:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:25:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2018-11-07 10:25:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 10:25:40,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:40,742 INFO L375 BasicCegarLoop]: trace histogram [14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:40,742 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:40,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 876152798, now seen corresponding path program 9 times [2018-11-07 10:25:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:40,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:40,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 10:25:40,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:40,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:40,939 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:40,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:40,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:40,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:40,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:25:40,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:25:41,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:25:41,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:41,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 10:25:41,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 10:25:41,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:41,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 10:25:41,340 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:41,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:25:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:25:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:25:41,341 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand 14 states. [2018-11-07 10:25:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:41,724 INFO L93 Difference]: Finished difference Result 985 states and 1328 transitions. [2018-11-07 10:25:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:25:41,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-11-07 10:25:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:41,729 INFO L225 Difference]: With dead ends: 985 [2018-11-07 10:25:41,729 INFO L226 Difference]: Without dead ends: 625 [2018-11-07 10:25:41,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:25:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-07 10:25:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 454. [2018-11-07 10:25:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-11-07 10:25:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 594 transitions. [2018-11-07 10:25:41,790 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 594 transitions. Word has length 195 [2018-11-07 10:25:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:41,791 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 594 transitions. [2018-11-07 10:25:41,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:25:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 594 transitions. [2018-11-07 10:25:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 10:25:41,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:41,796 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:41,796 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:41,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 72907851, now seen corresponding path program 10 times [2018-11-07 10:25:41,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:41,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:41,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:41,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 10:25:42,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:42,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:42,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:42,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:42,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:42,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:42,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:42,178 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 10:25:42,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 10:25:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 10:25:42,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:42,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:25:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:25:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:25:42,552 INFO L87 Difference]: Start difference. First operand 454 states and 594 transitions. Second operand 15 states. [2018-11-07 10:25:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:42,877 INFO L93 Difference]: Finished difference Result 1044 states and 1407 transitions. [2018-11-07 10:25:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:25:42,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2018-11-07 10:25:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:42,883 INFO L225 Difference]: With dead ends: 1044 [2018-11-07 10:25:42,883 INFO L226 Difference]: Without dead ends: 657 [2018-11-07 10:25:42,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:25:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-07 10:25:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 486. [2018-11-07 10:25:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-07 10:25:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 636 transitions. [2018-11-07 10:25:42,940 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 636 transitions. Word has length 207 [2018-11-07 10:25:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:42,940 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 636 transitions. [2018-11-07 10:25:42,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:25:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 636 transitions. [2018-11-07 10:25:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 10:25:42,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:42,944 INFO L375 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:42,944 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:42,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1743680062, now seen corresponding path program 11 times [2018-11-07 10:25:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:42,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:42,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-11-07 10:25:43,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:43,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:43,936 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:43,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:43,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:43,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:43,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:43,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:44,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:25:44,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:44,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 145 proven. 50 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-07 10:25:44,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 145 proven. 50 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-07 10:25:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-11-07 10:25:44,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:44,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:25:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:25:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:25:44,511 INFO L87 Difference]: Start difference. First operand 486 states and 636 transitions. Second operand 23 states. [2018-11-07 10:25:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:50,104 INFO L93 Difference]: Finished difference Result 2713 states and 3705 transitions. [2018-11-07 10:25:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-07 10:25:50,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 219 [2018-11-07 10:25:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:50,116 INFO L225 Difference]: With dead ends: 2713 [2018-11-07 10:25:50,117 INFO L226 Difference]: Without dead ends: 2296 [2018-11-07 10:25:50,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3948 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3647, Invalid=9235, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 10:25:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2018-11-07 10:25:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 540. [2018-11-07 10:25:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-07 10:25:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 710 transitions. [2018-11-07 10:25:50,220 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 710 transitions. Word has length 219 [2018-11-07 10:25:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:50,220 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 710 transitions. [2018-11-07 10:25:50,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:25:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 710 transitions. [2018-11-07 10:25:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 10:25:50,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:50,225 INFO L375 BasicCegarLoop]: trace histogram [18, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:50,226 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:50,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -361569774, now seen corresponding path program 12 times [2018-11-07 10:25:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 10:25:50,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:50,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:50,544 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:50,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:50,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:50,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:25:50,553 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:25:50,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:25:50,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:50,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 10:25:50,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 10:25:51,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:51,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 10:25:51,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:51,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:25:51,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:25:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:25:51,038 INFO L87 Difference]: Start difference. First operand 540 states and 710 transitions. Second operand 17 states. [2018-11-07 10:25:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:51,436 INFO L93 Difference]: Finished difference Result 1250 states and 1693 transitions. [2018-11-07 10:25:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:25:51,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 245 [2018-11-07 10:25:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:51,441 INFO L225 Difference]: With dead ends: 1250 [2018-11-07 10:25:51,441 INFO L226 Difference]: Without dead ends: 787 [2018-11-07 10:25:51,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:25:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-07 10:25:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 572. [2018-11-07 10:25:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-11-07 10:25:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 752 transitions. [2018-11-07 10:25:51,536 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 752 transitions. Word has length 245 [2018-11-07 10:25:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:51,536 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 752 transitions. [2018-11-07 10:25:51,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:25:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 752 transitions. [2018-11-07 10:25:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 10:25:51,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:51,540 INFO L375 BasicCegarLoop]: trace histogram [19, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:51,540 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:51,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash -651174523, now seen corresponding path program 13 times [2018-11-07 10:25:51,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 10:25:52,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:52,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:52,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:52,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:52,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:52,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:52,797 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:52,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 10:25:52,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 10:25:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 10:25:53,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:53,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:25:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:25:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:25:53,378 INFO L87 Difference]: Start difference. First operand 572 states and 752 transitions. Second operand 18 states. [2018-11-07 10:25:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:53,925 INFO L93 Difference]: Finished difference Result 1309 states and 1772 transitions. [2018-11-07 10:25:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:25:53,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 257 [2018-11-07 10:25:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:53,930 INFO L225 Difference]: With dead ends: 1309 [2018-11-07 10:25:53,930 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 10:25:53,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:25:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 10:25:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 604. [2018-11-07 10:25:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-07 10:25:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 794 transitions. [2018-11-07 10:25:54,025 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 794 transitions. Word has length 257 [2018-11-07 10:25:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:54,025 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 794 transitions. [2018-11-07 10:25:54,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:25:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 794 transitions. [2018-11-07 10:25:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 10:25:54,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:54,029 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:54,029 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:54,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1489484210, now seen corresponding path program 14 times [2018-11-07 10:25:54,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:54,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:54,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:54,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:54,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2018-11-07 10:25:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:54,389 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:54,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:25:54,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:54,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:54,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:25:54,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:54,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 140 proven. 152 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-07 10:25:54,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 212 proven. 80 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-07 10:25:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 11] total 38 [2018-11-07 10:25:55,267 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:55,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:25:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:25:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:25:55,268 INFO L87 Difference]: Start difference. First operand 604 states and 794 transitions. Second operand 29 states. [2018-11-07 10:26:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:05,147 INFO L93 Difference]: Finished difference Result 3744 states and 5126 transitions. [2018-11-07 10:26:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-11-07 10:26:05,148 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 269 [2018-11-07 10:26:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:05,161 INFO L225 Difference]: With dead ends: 3744 [2018-11-07 10:26:05,162 INFO L226 Difference]: Without dead ends: 3224 [2018-11-07 10:26:05,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10358 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8266, Invalid=21490, Unknown=0, NotChecked=0, Total=29756 [2018-11-07 10:26:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2018-11-07 10:26:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 658. [2018-11-07 10:26:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-07 10:26:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2018-11-07 10:26:05,318 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 269 [2018-11-07 10:26:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:05,319 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2018-11-07 10:26:05,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:26:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2018-11-07 10:26:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-07 10:26:05,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:05,323 INFO L375 BasicCegarLoop]: trace histogram [22, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:05,323 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:05,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 570716300, now seen corresponding path program 15 times [2018-11-07 10:26:05,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:05,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:05,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:05,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 10:26:05,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:05,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:05,659 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:05,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:05,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:05,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:05,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:26:05,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:26:05,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:26:05,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:05,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 10:26:05,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 10:26:06,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 10:26:06,271 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:06,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:26:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:26:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:26:06,273 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 20 states. [2018-11-07 10:26:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:06,880 INFO L93 Difference]: Finished difference Result 1515 states and 2058 transitions. [2018-11-07 10:26:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:26:06,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 295 [2018-11-07 10:26:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:06,886 INFO L225 Difference]: With dead ends: 1515 [2018-11-07 10:26:06,886 INFO L226 Difference]: Without dead ends: 949 [2018-11-07 10:26:06,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:26:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-07 10:26:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 690. [2018-11-07 10:26:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-07 10:26:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 910 transitions. [2018-11-07 10:26:07,027 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 910 transitions. Word has length 295 [2018-11-07 10:26:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:07,027 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 910 transitions. [2018-11-07 10:26:07,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:26:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 910 transitions. [2018-11-07 10:26:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-07 10:26:07,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:07,031 INFO L375 BasicCegarLoop]: trace histogram [23, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:07,032 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:07,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash 448796473, now seen corresponding path program 16 times [2018-11-07 10:26:07,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:07,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:07,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 10:26:07,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:07,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:07,527 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:07,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:07,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:07,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:07,535 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:07,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 10:26:07,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 10:26:09,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:09,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 10:26:09,242 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:09,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:26:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:26:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:26:09,243 INFO L87 Difference]: Start difference. First operand 690 states and 910 transitions. Second operand 21 states. [2018-11-07 10:26:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:10,172 INFO L93 Difference]: Finished difference Result 1574 states and 2137 transitions. [2018-11-07 10:26:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:26:10,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 307 [2018-11-07 10:26:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:10,177 INFO L225 Difference]: With dead ends: 1574 [2018-11-07 10:26:10,177 INFO L226 Difference]: Without dead ends: 981 [2018-11-07 10:26:10,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:26:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-11-07 10:26:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 722. [2018-11-07 10:26:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-07 10:26:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 952 transitions. [2018-11-07 10:26:10,330 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 952 transitions. Word has length 307 [2018-11-07 10:26:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:10,330 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 952 transitions. [2018-11-07 10:26:10,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:26:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 952 transitions. [2018-11-07 10:26:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-07 10:26:10,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:10,335 INFO L375 BasicCegarLoop]: trace histogram [24, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:10,335 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:10,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1205162732, now seen corresponding path program 17 times [2018-11-07 10:26:10,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:10,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2018-11-07 10:26:10,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:10,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:10,968 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:10,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:10,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:10,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:26:10,976 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:26:11,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:26:11,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:11,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 291 proven. 117 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2018-11-07 10:26:11,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 291 proven. 117 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2018-11-07 10:26:12,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2018-11-07 10:26:12,077 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:12,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:26:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:26:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:26:12,078 INFO L87 Difference]: Start difference. First operand 722 states and 952 transitions. Second operand 31 states. [2018-11-07 10:26:19,161 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-07 10:26:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:25,400 INFO L93 Difference]: Finished difference Result 4931 states and 6763 transitions. [2018-11-07 10:26:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-11-07 10:26:25,400 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 319 [2018-11-07 10:26:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:25,416 INFO L225 Difference]: With dead ends: 4931 [2018-11-07 10:26:25,417 INFO L226 Difference]: Without dead ends: 4308 [2018-11-07 10:26:25,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14847 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11259, Invalid=28541, Unknown=0, NotChecked=0, Total=39800 [2018-11-07 10:26:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2018-11-07 10:26:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 776. [2018-11-07 10:26:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-07 10:26:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1026 transitions. [2018-11-07 10:26:25,626 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1026 transitions. Word has length 319 [2018-11-07 10:26:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:25,626 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1026 transitions. [2018-11-07 10:26:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:26:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1026 transitions. [2018-11-07 10:26:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 10:26:25,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:25,631 INFO L375 BasicCegarLoop]: trace histogram [26, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:25,631 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:25,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1129991296, now seen corresponding path program 18 times [2018-11-07 10:26:25,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:25,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:25,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:25,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:25,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 10:26:26,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:26,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:26,419 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:26,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:26,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:26,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:26:26,428 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:26:26,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:26:26,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:26,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 10:26:26,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 10:26:27,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 10:26:27,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:27,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:26:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:26:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:26:27,244 INFO L87 Difference]: Start difference. First operand 776 states and 1026 transitions. Second operand 23 states. [2018-11-07 10:26:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:28,287 INFO L93 Difference]: Finished difference Result 1780 states and 2423 transitions. [2018-11-07 10:26:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:26:28,290 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 345 [2018-11-07 10:26:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:28,296 INFO L225 Difference]: With dead ends: 1780 [2018-11-07 10:26:28,296 INFO L226 Difference]: Without dead ends: 1111 [2018-11-07 10:26:28,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:26:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-11-07 10:26:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 808. [2018-11-07 10:26:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-07 10:26:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-11-07 10:26:28,486 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 345 [2018-11-07 10:26:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:28,486 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-11-07 10:26:28,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:26:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-11-07 10:26:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-11-07 10:26:28,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:28,490 INFO L375 BasicCegarLoop]: trace histogram [27, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:28,491 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1908960691, now seen corresponding path program 19 times [2018-11-07 10:26:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:28,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:28,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 10:26:29,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:29,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:29,040 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:29,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:29,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:29,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:29,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:29,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:29,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 10:26:29,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 10:26:29,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:29,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 10:26:29,952 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:29,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:26:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:26:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:26:29,954 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 24 states. [2018-11-07 10:26:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:30,771 INFO L93 Difference]: Finished difference Result 1839 states and 2502 transitions. [2018-11-07 10:26:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:26:30,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 357 [2018-11-07 10:26:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:30,785 INFO L225 Difference]: With dead ends: 1839 [2018-11-07 10:26:30,785 INFO L226 Difference]: Without dead ends: 1143 [2018-11-07 10:26:30,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:26:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-11-07 10:26:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 840. [2018-11-07 10:26:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-07 10:26:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1110 transitions. [2018-11-07 10:26:30,950 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1110 transitions. Word has length 357 [2018-11-07 10:26:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:30,951 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1110 transitions. [2018-11-07 10:26:30,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:26:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1110 transitions. [2018-11-07 10:26:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-07 10:26:30,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:30,955 INFO L375 BasicCegarLoop]: trace histogram [28, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:30,955 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:30,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1197059104, now seen corresponding path program 20 times [2018-11-07 10:26:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:30,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 2100 trivial. 0 not checked. [2018-11-07 10:26:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:31,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:31,356 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:31,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:31,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:31,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:26:31,366 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:26:31,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:26:31,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:31,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 382 proven. 161 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-07 10:26:31,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 382 proven. 161 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-07 10:26:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 13] total 46 [2018-11-07 10:26:32,354 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:32,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:26:32,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:26:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:26:32,355 INFO L87 Difference]: Start difference. First operand 840 states and 1110 transitions. Second operand 35 states. [2018-11-07 10:26:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:50,060 INFO L93 Difference]: Finished difference Result 6274 states and 8616 transitions. [2018-11-07 10:26:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-11-07 10:26:50,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 369 [2018-11-07 10:26:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:50,087 INFO L225 Difference]: With dead ends: 6274 [2018-11-07 10:26:50,087 INFO L226 Difference]: Without dead ends: 5548 [2018-11-07 10:26:50,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25447 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17825, Invalid=45427, Unknown=0, NotChecked=0, Total=63252 [2018-11-07 10:26:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-11-07 10:26:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 894. [2018-11-07 10:26:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-07 10:26:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1184 transitions. [2018-11-07 10:26:50,439 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1184 transitions. Word has length 369 [2018-11-07 10:26:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1184 transitions. [2018-11-07 10:26:50,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:26:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1184 transitions. [2018-11-07 10:26:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 10:26:50,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:50,445 INFO L375 BasicCegarLoop]: trace histogram [30, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:50,445 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:50,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash -69103558, now seen corresponding path program 21 times [2018-11-07 10:26:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:50,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:50,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 10:26:51,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:51,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:51,010 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:51,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:51,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:51,011 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:26:51,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:26:51,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:26:51,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:51,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 10:26:51,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 10:26:51,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:51,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 10:26:51,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:51,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:26:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:26:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:26:51,991 INFO L87 Difference]: Start difference. First operand 894 states and 1184 transitions. Second operand 26 states. [2018-11-07 10:26:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:52,913 INFO L93 Difference]: Finished difference Result 2045 states and 2788 transitions. [2018-11-07 10:26:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:26:52,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 395 [2018-11-07 10:26:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:52,922 INFO L225 Difference]: With dead ends: 2045 [2018-11-07 10:26:52,922 INFO L226 Difference]: Without dead ends: 1273 [2018-11-07 10:26:52,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:26:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2018-11-07 10:26:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 926. [2018-11-07 10:26:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-11-07 10:26:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1226 transitions. [2018-11-07 10:26:53,172 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1226 transitions. Word has length 395 [2018-11-07 10:26:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1226 transitions. [2018-11-07 10:26:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:26:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1226 transitions. [2018-11-07 10:26:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-11-07 10:26:53,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:53,176 INFO L375 BasicCegarLoop]: trace histogram [31, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:53,176 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:53,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 515422503, now seen corresponding path program 22 times [2018-11-07 10:26:53,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 10:26:54,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:54,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:54,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:54,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:54,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:54,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:54,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:54,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:54,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 10:26:54,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 10:26:55,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:55,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 10:26:55,216 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:26:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:26:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:26:55,217 INFO L87 Difference]: Start difference. First operand 926 states and 1226 transitions. Second operand 27 states. [2018-11-07 10:26:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:56,321 INFO L93 Difference]: Finished difference Result 2104 states and 2867 transitions. [2018-11-07 10:26:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:26:56,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 407 [2018-11-07 10:26:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:56,328 INFO L225 Difference]: With dead ends: 2104 [2018-11-07 10:26:56,328 INFO L226 Difference]: Without dead ends: 1305 [2018-11-07 10:26:56,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:26:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-11-07 10:26:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 958. [2018-11-07 10:26:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-07 10:26:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1268 transitions. [2018-11-07 10:26:56,562 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1268 transitions. Word has length 407 [2018-11-07 10:26:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:56,562 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1268 transitions. [2018-11-07 10:26:56,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:26:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1268 transitions. [2018-11-07 10:26:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-07 10:26:56,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:56,566 INFO L375 BasicCegarLoop]: trace histogram [32, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:56,566 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:56,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2068583782, now seen corresponding path program 23 times [2018-11-07 10:26:56,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:56,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-11-07 10:26:57,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:57,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:57,559 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:57,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:57,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:57,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:26:57,569 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:26:57,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:26:57,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:57,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 485 proven. 212 refuted. 0 times theorem prover too weak. 3487 trivial. 0 not checked. [2018-11-07 10:26:58,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:59,505 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 10:27:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 485 proven. 212 refuted. 0 times theorem prover too weak. 3487 trivial. 0 not checked. [2018-11-07 10:27:00,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:00,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 14] total 51 [2018-11-07 10:27:00,540 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:00,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:27:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:27:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=1993, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:27:00,542 INFO L87 Difference]: Start difference. First operand 958 states and 1268 transitions. Second operand 39 states. [2018-11-07 10:27:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:24,066 INFO L93 Difference]: Finished difference Result 7773 states and 10685 transitions. [2018-11-07 10:27:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 288 states. [2018-11-07 10:27:24,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 419 [2018-11-07 10:27:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:24,083 INFO L225 Difference]: With dead ends: 7773 [2018-11-07 10:27:24,083 INFO L226 Difference]: Without dead ends: 6944 [2018-11-07 10:27:24,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1357 GetRequests, 1048 SyntacticMatches, 1 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41179 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=26873, Invalid=68917, Unknown=0, NotChecked=0, Total=95790 [2018-11-07 10:27:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-11-07 10:27:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 1012. [2018-11-07 10:27:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-11-07 10:27:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1342 transitions. [2018-11-07 10:27:24,533 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1342 transitions. Word has length 419 [2018-11-07 10:27:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:24,533 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1342 transitions. [2018-11-07 10:27:24,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:27:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1342 transitions. [2018-11-07 10:27:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-07 10:27:24,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:24,537 INFO L375 BasicCegarLoop]: trace histogram [34, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:24,537 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:24,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1381268974, now seen corresponding path program 24 times [2018-11-07 10:27:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:24,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:24,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 10:27:25,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:25,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:25,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:25,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:25,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:25,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:27:25,757 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:27:25,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:27:25,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:25,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 10:27:26,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 10:27:26,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:26,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 10:27:26,922 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:26,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:27:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:27:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:27:26,923 INFO L87 Difference]: Start difference. First operand 1012 states and 1342 transitions. Second operand 29 states. [2018-11-07 10:27:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:28,284 INFO L93 Difference]: Finished difference Result 2310 states and 3153 transitions. [2018-11-07 10:27:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:27:28,285 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 445 [2018-11-07 10:27:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:28,290 INFO L225 Difference]: With dead ends: 2310 [2018-11-07 10:27:28,290 INFO L226 Difference]: Without dead ends: 1435 [2018-11-07 10:27:28,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:27:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2018-11-07 10:27:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1044. [2018-11-07 10:27:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-07 10:27:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1384 transitions. [2018-11-07 10:27:28,754 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1384 transitions. Word has length 445 [2018-11-07 10:27:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:28,754 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 1384 transitions. [2018-11-07 10:27:28,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:27:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1384 transitions. [2018-11-07 10:27:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-11-07 10:27:28,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:28,760 INFO L375 BasicCegarLoop]: trace histogram [35, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:28,760 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:28,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -806193951, now seen corresponding path program 25 times [2018-11-07 10:27:28,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 10:27:30,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:30,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:30,063 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:30,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:30,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:30,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:30,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:30,072 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:30,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 10:27:30,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 10:27:31,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:31,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 10:27:31,235 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:31,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:27:31,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:27:31,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:27:31,237 INFO L87 Difference]: Start difference. First operand 1044 states and 1384 transitions. Second operand 30 states. [2018-11-07 10:27:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:32,565 INFO L93 Difference]: Finished difference Result 2369 states and 3232 transitions. [2018-11-07 10:27:32,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:27:32,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 457 [2018-11-07 10:27:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:32,570 INFO L225 Difference]: With dead ends: 2369 [2018-11-07 10:27:32,571 INFO L226 Difference]: Without dead ends: 1467 [2018-11-07 10:27:32,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:27:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-07 10:27:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1076. [2018-11-07 10:27:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-07 10:27:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1426 transitions. [2018-11-07 10:27:32,964 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1426 transitions. Word has length 457 [2018-11-07 10:27:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:32,964 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1426 transitions. [2018-11-07 10:27:32,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:27:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1426 transitions. [2018-11-07 10:27:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-11-07 10:27:32,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:32,968 INFO L375 BasicCegarLoop]: trace histogram [36, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:32,969 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:32,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1893229966, now seen corresponding path program 26 times [2018-11-07 10:27:32,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:32,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:32,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:32,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2018-11-07 10:27:34,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:34,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:34,695 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:34,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:34,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:34,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:34,704 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:34,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:27:34,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:34,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 600 proven. 270 refuted. 0 times theorem prover too weak. 4440 trivial. 0 not checked. [2018-11-07 10:27:35,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 600 proven. 270 refuted. 0 times theorem prover too weak. 4440 trivial. 0 not checked. [2018-11-07 10:27:36,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:36,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15, 15] total 56 [2018-11-07 10:27:36,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:36,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:27:36,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:27:36,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2398, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:27:36,384 INFO L87 Difference]: Start difference. First operand 1076 states and 1426 transitions. Second operand 43 states. [2018-11-07 10:28:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:11,067 INFO L93 Difference]: Finished difference Result 9428 states and 12970 transitions. [2018-11-07 10:28:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 350 states. [2018-11-07 10:28:11,068 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 469 [2018-11-07 10:28:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:11,077 INFO L225 Difference]: With dead ends: 9428 [2018-11-07 10:28:11,078 INFO L226 Difference]: Without dead ends: 8496 [2018-11-07 10:28:11,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1575 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62775 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=38952, Invalid=100550, Unknown=0, NotChecked=0, Total=139502 [2018-11-07 10:28:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2018-11-07 10:28:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 1130. [2018-11-07 10:28:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-07 10:28:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1500 transitions. [2018-11-07 10:28:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1500 transitions. Word has length 469 [2018-11-07 10:28:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:11,738 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1500 transitions. [2018-11-07 10:28:11,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:28:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1500 transitions. [2018-11-07 10:28:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-07 10:28:11,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:11,744 INFO L375 BasicCegarLoop]: trace histogram [38, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:11,744 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:11,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 786032360, now seen corresponding path program 27 times [2018-11-07 10:28:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:11,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:11,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 10:28:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:12,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:12,862 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:12,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:12,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:12,862 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:12,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:28:12,873 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:28:13,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:28:13,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:13,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 10:28:13,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 10:28:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 10:28:14,821 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:14,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:28:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:28:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:28:14,822 INFO L87 Difference]: Start difference. First operand 1130 states and 1500 transitions. Second operand 32 states. [2018-11-07 10:28:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:16,432 INFO L93 Difference]: Finished difference Result 2575 states and 3518 transitions. [2018-11-07 10:28:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:28:16,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 495 [2018-11-07 10:28:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:16,435 INFO L225 Difference]: With dead ends: 2575 [2018-11-07 10:28:16,436 INFO L226 Difference]: Without dead ends: 1597 [2018-11-07 10:28:16,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:28:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-11-07 10:28:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1162. [2018-11-07 10:28:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2018-11-07 10:28:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1542 transitions. [2018-11-07 10:28:16,839 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1542 transitions. Word has length 495 [2018-11-07 10:28:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:16,840 INFO L480 AbstractCegarLoop]: Abstraction has 1162 states and 1542 transitions. [2018-11-07 10:28:16,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:28:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1542 transitions. [2018-11-07 10:28:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-11-07 10:28:16,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:16,844 INFO L375 BasicCegarLoop]: trace histogram [39, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:16,844 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:16,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash -904928747, now seen corresponding path program 28 times [2018-11-07 10:28:16,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:16,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:16,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 10:28:17,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:17,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:17,784 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:17,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:17,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:17,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:17,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:17,794 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:17,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 10:28:18,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 10:28:19,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:19,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 10:28:19,189 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:28:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:28:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:28:19,191 INFO L87 Difference]: Start difference. First operand 1162 states and 1542 transitions. Second operand 33 states. [2018-11-07 10:28:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:21,018 INFO L93 Difference]: Finished difference Result 2634 states and 3597 transitions. [2018-11-07 10:28:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:28:21,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 507 [2018-11-07 10:28:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:21,021 INFO L225 Difference]: With dead ends: 2634 [2018-11-07 10:28:21,022 INFO L226 Difference]: Without dead ends: 1629 [2018-11-07 10:28:21,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:28:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-11-07 10:28:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1194. [2018-11-07 10:28:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2018-11-07 10:28:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1584 transitions. [2018-11-07 10:28:21,412 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1584 transitions. Word has length 507 [2018-11-07 10:28:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:21,413 INFO L480 AbstractCegarLoop]: Abstraction has 1194 states and 1584 transitions. [2018-11-07 10:28:21,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:28:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1584 transitions. [2018-11-07 10:28:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-11-07 10:28:21,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:21,417 INFO L375 BasicCegarLoop]: trace histogram [40, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:21,417 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:21,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2028750520, now seen corresponding path program 29 times [2018-11-07 10:28:21,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:21,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2018-11-07 10:28:22,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:22,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:22,081 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:22,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:22,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:22,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:22,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:28:22,089 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:22,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:28:22,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:22,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 727 proven. 335 refuted. 0 times theorem prover too weak. 5508 trivial. 0 not checked. [2018-11-07 10:28:22,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 727 proven. 335 refuted. 0 times theorem prover too weak. 5508 trivial. 0 not checked. [2018-11-07 10:28:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16, 16] total 61 [2018-11-07 10:28:23,774 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:23,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:28:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:28:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=2840, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:28:23,775 INFO L87 Difference]: Start difference. First operand 1194 states and 1584 transitions. Second operand 47 states. [2018-11-07 10:28:53,844 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-07 10:29:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:12,376 INFO L93 Difference]: Finished difference Result 11239 states and 15471 transitions. [2018-11-07 10:29:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 418 states. [2018-11-07 10:29:12,376 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 519 [2018-11-07 10:29:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:12,391 INFO L225 Difference]: With dead ends: 11239 [2018-11-07 10:29:12,391 INFO L226 Difference]: Without dead ends: 10204 [2018-11-07 10:29:12,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1805 GetRequests, 1363 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91747 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=54665, Invalid=142027, Unknown=0, NotChecked=0, Total=196692 [2018-11-07 10:29:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10204 states. [2018-11-07 10:29:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10204 to 1248. [2018-11-07 10:29:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2018-11-07 10:29:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1658 transitions. [2018-11-07 10:29:12,994 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1658 transitions. Word has length 519 [2018-11-07 10:29:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:12,994 INFO L480 AbstractCegarLoop]: Abstraction has 1248 states and 1658 transitions. [2018-11-07 10:29:12,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:29:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1658 transitions. [2018-11-07 10:29:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-11-07 10:29:12,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:12,998 INFO L375 BasicCegarLoop]: trace histogram [42, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:12,998 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:12,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1343157852, now seen corresponding path program 30 times [2018-11-07 10:29:12,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:13,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:13,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7156 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2018-11-07 10:29:13,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:13,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:13,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:13,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:13,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:13,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:13,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:13,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:13,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:13,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7156 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2018-11-07 10:29:14,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7156 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2018-11-07 10:29:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 10:29:15,437 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:15,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:29:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:29:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:29:15,438 INFO L87 Difference]: Start difference. First operand 1248 states and 1658 transitions. Second operand 35 states. Received shutdown request... [2018-11-07 10:29:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:29:17,102 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:29:17,108 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:29:17,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:29:17 BoogieIcfgContainer [2018-11-07 10:29:17,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:29:17,109 INFO L168 Benchmark]: Toolchain (without parser) took 237311.75 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 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-07 10:29:17,110 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:29:17,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:17,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:29:17,111 INFO L168 Benchmark]: Boogie Preprocessor took 117.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:17,111 INFO L168 Benchmark]: RCFGBuilder took 700.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:17,112 INFO L168 Benchmark]: TraceAbstraction took 236057.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -807.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 10:29:17,116 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.24 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 399.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 700.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236057.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -807.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (1248states) and FLOYD_HOARE automaton (currently 34 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (1832 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 85 locations, 1 error locations. TIMEOUT Result, 235.9s OverallTime, 34 OverallIterations, 42 TraceHistogramMax, 180.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8074 SDtfs, 92817 SDslu, 51964 SDs, 0 SdLazy, 51836 SolverSat, 25201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21626 GetRequests, 18880 SyntacticMatches, 1 SemanticMatches, 2745 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253999 ImplicationChecksByTransitivity, 101.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1248occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 41537 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 18104 NumberOfCodeBlocks, 16892 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 27040 ConstructedInterpolants, 0 QuantifiedInterpolants, 18351940 SizeOfPredicates, 64 NumberOfNonLiveVariables, 18414 ConjunctsInSsa, 530 ConjunctsInUnsatCore, 98 InterpolantComputations, 4 PerfectInterpolantSequences, 166685/229512 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown