java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:26:57,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:26:57,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:26:57,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:26:57,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:26:57,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:26:57,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:26:57,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:26:57,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:26:57,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:26:57,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:26:57,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:26:57,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:26:57,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:26:57,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:26:57,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:26:57,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:26:57,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:26:57,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:26:57,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:26:57,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:26:57,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:26:57,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:26:57,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:26:57,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:26:57,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:26:57,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:26:57,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:26:57,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:26:57,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:26:57,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:26:57,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:26:57,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:26:57,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:26:57,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:26:57,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:26:57,141 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:26:57,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:26:57,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:26:57,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:26:57,170 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:26:57,170 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:26:57,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:26:57,171 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:26:57,171 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:26:57,171 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:26:57,171 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:26:57,171 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:26:57,172 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:26:57,172 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:26:57,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:26:57,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:26:57,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:26:57,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:26:57,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:26:57,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:26:57,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:26:57,174 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:26:57,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:26:57,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:26:57,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:26:57,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:26:57,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:26:57,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:26:57,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:26:57,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:26:57,176 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:26:57,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:26:57,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:26:57,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:26:57,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:26:57,238 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:26:57,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-12 20:26:57,296 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0016e5c/858c611e29fe42c49a93692620459122/FLAG71927be81 [2018-11-12 20:26:57,735 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:26:57,736 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-12 20:26:57,745 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0016e5c/858c611e29fe42c49a93692620459122/FLAG71927be81 [2018-11-12 20:26:57,762 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0016e5c/858c611e29fe42c49a93692620459122 [2018-11-12 20:26:57,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:26:57,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:26:57,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:26:57,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:26:57,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:26:57,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:26:57" (1/1) ... [2018-11-12 20:26:57,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dce54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:57, skipping insertion in model container [2018-11-12 20:26:57,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:26:57" (1/1) ... [2018-11-12 20:26:57,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:26:57,821 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:26:58,064 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:26:58,074 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:26:58,094 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:26:58,108 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:26:58,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58 WrapperNode [2018-11-12 20:26:58,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:26:58,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:26:58,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:26:58,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:26:58,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:26:58,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:26:58,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:26:58,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:26:58,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... [2018-11-12 20:26:58,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:26:58,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:26:58,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:26:58,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:26:58,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:26:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:26:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:26:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:26:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-12 20:26:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-12 20:26:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:26:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:26:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:26:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:26:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:26:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:26:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:26:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:26:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:26:58,694 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:26:58,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:26:58 BoogieIcfgContainer [2018-11-12 20:26:58,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:26:58,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:26:58,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:26:58,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:26:58,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:26:57" (1/3) ... [2018-11-12 20:26:58,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5474926f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:26:58, skipping insertion in model container [2018-11-12 20:26:58,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:58" (2/3) ... [2018-11-12 20:26:58,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5474926f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:26:58, skipping insertion in model container [2018-11-12 20:26:58,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:26:58" (3/3) ... [2018-11-12 20:26:58,704 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-11-12 20:26:58,715 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:26:58,724 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:26:58,741 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:26:58,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:26:58,777 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:26:58,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:26:58,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:26:58,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:26:58,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:26:58,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:26:58,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:26:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-12 20:26:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:26:58,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:58,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:26:58,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:58,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1855752643, now seen corresponding path program 1 times [2018-11-12 20:26:58,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:58,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:26:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:26:59,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:26:59,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:26:59,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:26:59,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:26:59,033 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-12 20:26:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:26:59,056 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-12 20:26:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:26:59,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-12 20:26:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:26:59,067 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:26:59,068 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:26:59,072 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-12 20:26:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:26:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-12 20:26:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:26:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-12 20:26:59,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-12 20:26:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:26:59,118 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-12 20:26:59,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:26:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-12 20:26:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:26:59,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:59,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:26:59,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1049182020, now seen corresponding path program 1 times [2018-11-12 20:26:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:59,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:59,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:59,627 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-11-12 20:26:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:59,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:26:59,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:26:59,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:26:59,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:26:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:26:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:26:59,830 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-11-12 20:27:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:00,313 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-12 20:27:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:27:00,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:27:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:00,317 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:27:00,318 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:27:00,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:27:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:27:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-12 20:27:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:27:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-12 20:27:00,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2018-11-12 20:27:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:00,327 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-12 20:27:00,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:27:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-12 20:27:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:27:00,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:00,329 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:00,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:00,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1502974941, now seen corresponding path program 1 times [2018-11-12 20:27:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:00,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:00,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:00,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:00,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:27:00,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:27:00,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:27:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:27:00,530 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2018-11-12 20:27:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:00,588 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-12 20:27:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:27:00,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:27:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:00,590 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:27:00,591 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:27:00,591 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:27:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:27:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-12 20:27:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:27:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-12 20:27:00,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-12 20:27:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:00,597 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-12 20:27:00,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:27:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-12 20:27:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:27:00,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:00,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:00,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:00,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1442209030, now seen corresponding path program 1 times [2018-11-12 20:27:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:00,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:00,982 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-11-12 20:27:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:27:01,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:27:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:27:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:27:01,166 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-12 20:27:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:01,292 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-12 20:27:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:27:01,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-12 20:27:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:01,295 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:27:01,295 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:27:01,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:27:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:27:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-12 20:27:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:27:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-12 20:27:01,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-12 20:27:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:01,303 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-12 20:27:01,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:27:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-12 20:27:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:27:01,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:01,304 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:01,305 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:01,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash -469535236, now seen corresponding path program 1 times [2018-11-12 20:27:01,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:01,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:01,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:01,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:01,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:01,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:27:01,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:01,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:27:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:27:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:27:01,417 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-12 20:27:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:01,648 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-12 20:27:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:27:01,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-12 20:27:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:01,650 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:27:01,653 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:27:01,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:27:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:27:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-12 20:27:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:27:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-12 20:27:01,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2018-11-12 20:27:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:01,665 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-12 20:27:01,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:27:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-12 20:27:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:27:01,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:01,667 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:01,667 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:01,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:01,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1056341250, now seen corresponding path program 1 times [2018-11-12 20:27:01,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:01,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:01,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:02,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:02,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:02,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-12 20:27:02,148 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-12 20:27:02,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:02,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:02,332 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:02,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:02,766 INFO L272 AbstractInterpreter]: Visited 22 different actions 94 times. Merged at 8 different actions 64 times. Widened at 1 different actions 4 times. Performed 607 root evaluator evaluations with a maximum evaluation depth of 6. Performed 607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 2 different actions. Largest state had 25 variables. [2018-11-12 20:27:02,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:02,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:02,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:02,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:02,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:02,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:03,477 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-12 20:27:05,536 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-12 20:27:05,892 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-11-12 20:27:07,963 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 20:27:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:08,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:08,287 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2018-11-12 20:27:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:10,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:10,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 23 [2018-11-12 20:27:10,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:10,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:27:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:27:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=369, Unknown=1, NotChecked=0, Total=506 [2018-11-12 20:27:10,926 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 16 states. [2018-11-12 20:27:11,183 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-12 20:27:13,327 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-11-12 20:27:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:13,466 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-12 20:27:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:27:13,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-12 20:27:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:13,474 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:27:13,474 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:27:13,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2018-11-12 20:27:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:27:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-11-12 20:27:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:27:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-12 20:27:13,483 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2018-11-12 20:27:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:13,483 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-12 20:27:13,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:27:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-12 20:27:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:27:13,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:13,485 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] [2018-11-12 20:27:13,485 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:13,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1449368260, now seen corresponding path program 1 times [2018-11-12 20:27:13,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:13,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:14,027 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 30 [2018-11-12 20:27:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:14,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:14,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:14,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-12 20:27:14,271 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-12 20:27:14,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:14,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:14,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:14,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:14,566 INFO L272 AbstractInterpreter]: Visited 23 different actions 105 times. Merged at 9 different actions 65 times. Widened at 1 different actions 4 times. Performed 676 root evaluator evaluations with a maximum evaluation depth of 6. Performed 676 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 19 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-12 20:27:14,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:14,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:14,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:14,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:14,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:14,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:14,700 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:27:14,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,718 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:27:14,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,736 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:27:14,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-11-12 20:27:14,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-12 20:27:14,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-12 20:27:14,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-12 20:27:14,870 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,879 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:14,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-12 20:27:14,909 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:418, output treesize:60 [2018-11-12 20:27:21,077 WARN L179 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-12 20:27:21,356 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-12 20:27:23,535 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-12 20:27:25,598 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-12 20:27:27,101 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-11-12 20:27:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:27,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:27,445 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-11-12 20:27:28,447 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-12 20:27:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:28,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:28,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2018-11-12 20:27:28,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:28,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:27:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:27:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=487, Unknown=1, NotChecked=0, Total=600 [2018-11-12 20:27:28,598 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 16 states. [2018-11-12 20:27:29,404 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-11-12 20:27:29,700 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-11-12 20:27:31,571 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-12 20:27:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:32,334 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-12 20:27:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:27:32,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-12 20:27:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:32,338 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:27:32,338 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:27:32,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=178, Invalid=751, Unknown=1, NotChecked=0, Total=930 [2018-11-12 20:27:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:27:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-11-12 20:27:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:27:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-12 20:27:32,346 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2018-11-12 20:27:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:32,347 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-12 20:27:32,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:27:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-12 20:27:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:27:32,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:32,348 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:32,348 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:32,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:32,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1283050746, now seen corresponding path program 1 times [2018-11-12 20:27:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:32,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 20:27:32,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:27:32,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:32,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:27:32,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:27:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:27:32,560 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-12 20:27:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:32,628 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-12 20:27:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:27:32,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-12 20:27:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:32,630 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:27:32,630 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:27:32,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:27:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:27:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-12 20:27:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:27:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-12 20:27:32,638 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2018-11-12 20:27:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:32,638 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-12 20:27:32,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:27:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-12 20:27:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:27:32,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:32,639 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:32,639 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:32,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash 890023736, now seen corresponding path program 1 times [2018-11-12 20:27:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:32,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:32,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:32,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:32,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:32,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-12 20:27:32,764 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [22], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-12 20:27:32,766 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:32,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:32,774 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:32,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:32,964 INFO L272 AbstractInterpreter]: Visited 24 different actions 136 times. Merged at 10 different actions 81 times. Widened at 2 different actions 6 times. Performed 833 root evaluator evaluations with a maximum evaluation depth of 6. Performed 833 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 29 fixpoints after 6 different actions. Largest state had 25 variables. [2018-11-12 20:27:33,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:33,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:33,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:33,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:33,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:33,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:33,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:33,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:33,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-12 20:27:33,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:33,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:27:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:27:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:27:33,150 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-12 20:27:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:33,224 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-12 20:27:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:27:33,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-12 20:27:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:33,227 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:27:33,227 INFO L226 Difference]: Without dead ends: 44 [2018-11-12 20:27:33,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:27:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-12 20:27:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-12 20:27:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:27:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-12 20:27:33,238 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2018-11-12 20:27:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:33,238 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-12 20:27:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:27:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-12 20:27:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:27:33,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:33,240 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:33,240 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:33,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 696244732, now seen corresponding path program 2 times [2018-11-12 20:27:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:33,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:33,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:33,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:33,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:33,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:33,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:33,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:27:33,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:33,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:33,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-12 20:27:33,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:33,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:27:34,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:27:34,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:34,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-11-12 20:27:34,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:27:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:27:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:27:34,572 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 13 states. [2018-11-12 20:27:34,764 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-12 20:27:34,922 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 11 [2018-11-12 20:27:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:35,669 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-12 20:27:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:27:35,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-12 20:27:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:35,671 INFO L225 Difference]: With dead ends: 56 [2018-11-12 20:27:35,671 INFO L226 Difference]: Without dead ends: 44 [2018-11-12 20:27:35,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:27:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-12 20:27:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-12 20:27:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:27:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-12 20:27:35,680 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-11-12 20:27:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:35,680 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-12 20:27:35,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:27:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-12 20:27:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:27:35,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:35,681 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:35,682 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:35,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash 303217722, now seen corresponding path program 2 times [2018-11-12 20:27:35,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:35,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:35,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:50,108 WARN L179 SmtUtils]: Spent 14.30 s on a formula simplification. DAG size of input: 125 DAG size of output: 32 [2018-11-12 20:27:50,796 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-11-12 20:27:50,886 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term; at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.unaryNumericMinus(SmtUtils.java:578) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1272) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubstitutionWithLocalSimplification.convertApplicationTerm(SubstitutionWithLocalSimplification.java:57) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IteRemover.removeIteTerm(IteRemover.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IteRemover.transformNonCoreBooleanSubterm(IteRemover.java:66) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:97) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer.transform(NonCoreBooleanSubTermTransformer.java:49) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-12 20:27:50,890 INFO L168 Benchmark]: Toolchain (without parser) took 53116.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -445.0 MB). Peak memory consumption was 423.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:50,891 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:27:50,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.63 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-12 20:27:50,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.81 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-12 20:27:50,893 INFO L168 Benchmark]: Boogie Preprocessor took 32.07 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-12 20:27:50,893 INFO L168 Benchmark]: RCFGBuilder took 530.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:50,894 INFO L168 Benchmark]: TraceAbstraction took 52192.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 327.1 MB). Peak memory consumption was 458.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:50,900 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.63 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 22.81 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 32.07 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. * RCFGBuilder took 530.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52192.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 327.1 MB). Peak memory consumption was 458.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term;: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.unaryNumericMinus(SmtUtils.java:578) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...