java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-programs/copysome2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:39:56,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:39:56,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:39:56,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:39:56,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:39:56,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:39:56,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:39:56,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:39:56,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:39:56,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:39:56,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:39:56,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:39:56,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:39:56,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:39:56,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:39:56,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:39:56,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:39:56,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:39:56,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:39:56,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:39:56,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:39:56,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:39:56,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:39:56,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:39:56,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:39:56,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:39:56,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:39:56,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:39:56,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:39:56,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:39:56,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:39:56,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:39:56,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:39:56,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:39:56,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:39:56,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:39:56,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:39:56,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:39:56,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:39:56,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:39:56,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:39:56,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:39:56,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:39:56,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:39:56,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:39:56,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:39:56,221 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:39:56,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:39:56,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:39:56,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:39:56,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:39:56,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:39:56,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:39:56,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:39:56,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:39:56,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:39:56,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:39:56,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:39:56,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:39:56,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:39:56,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:39:56,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:39:56,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:39:56,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:39:56,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:39:56,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:39:56,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:39:56,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:39:56,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:39:56,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:39:56,532 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:39:56,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome2-1.i [2019-10-07 00:39:56,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0942170ae/ca76e0f2ba84427d9deb005add10ea3a/FLAG1aaa6ae0b [2019-10-07 00:39:57,102 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:39:57,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/copysome2-1.i [2019-10-07 00:39:57,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0942170ae/ca76e0f2ba84427d9deb005add10ea3a/FLAG1aaa6ae0b [2019-10-07 00:39:57,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0942170ae/ca76e0f2ba84427d9deb005add10ea3a [2019-10-07 00:39:57,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:39:57,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:39:57,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:39:57,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:39:57,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:39:57,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be43138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57, skipping insertion in model container [2019-10-07 00:39:57,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:39:57,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:39:57,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:39:57,719 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:39:57,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:39:57,770 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:39:57,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57 WrapperNode [2019-10-07 00:39:57,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:39:57,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:39:57,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:39:57,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:39:57,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (1/1) ... [2019-10-07 00:39:57,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:39:57,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:39:57,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:39:57,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:39:57,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (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 [2019-10-07 00:39:57,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:39:57,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:39:57,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:39:57,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:39:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:39:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:39:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:39:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:39:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:39:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:39:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:39:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:39:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:39:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:39:58,471 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:39:58,471 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 00:39:58,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:39:58 BoogieIcfgContainer [2019-10-07 00:39:58,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:39:58,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:39:58,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:39:58,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:39:58,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:39:57" (1/3) ... [2019-10-07 00:39:58,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dae53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:39:58, skipping insertion in model container [2019-10-07 00:39:58,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:39:57" (2/3) ... [2019-10-07 00:39:58,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dae53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:39:58, skipping insertion in model container [2019-10-07 00:39:58,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:39:58" (3/3) ... [2019-10-07 00:39:58,482 INFO L109 eAbstractionObserver]: Analyzing ICFG copysome2-1.i [2019-10-07 00:39:58,492 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:39:58,500 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:39:58,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:39:58,531 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:39:58,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:39:58,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:39:58,532 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:39:58,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:39:58,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:39:58,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:39:58,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:39:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:39:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:39:58,555 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:39:58,556 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:39:58,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:39:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:39:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash -29131444, now seen corresponding path program 1 times [2019-10-07 00:39:58,571 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:39:58,571 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:58,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:58,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:39:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:39:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:39:58,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:58,750 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:39:58,751 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:39:58,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:39:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:39:58,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:39:58,769 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-07 00:39:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:39:58,832 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-07 00:39:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:39:58,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:39:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:39:58,844 INFO L225 Difference]: With dead ends: 37 [2019-10-07 00:39:58,845 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 00:39:58,848 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:39:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 00:39:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 00:39:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:39:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-07 00:39:58,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-10-07 00:39:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:39:58,892 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-07 00:39:58,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:39:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-07 00:39:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:39:58,894 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:39:58,894 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:39:58,894 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:39:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:39:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 762072982, now seen corresponding path program 1 times [2019-10-07 00:39:58,895 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:39:58,895 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:58,896 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:58,896 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:39:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:39:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:39:59,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:59,011 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:39:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:39:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:39:59,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:39:59,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:39:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:39:59,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:39:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:39:59,161 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:39:59,196 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:39:59,197 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:39:59,224 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:39:59,240 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:39:59,240 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:39:59,421 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:39:59,835 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-07 00:40:00,459 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:40:00,475 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:40:00,484 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:40:00,484 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:40:00,485 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 200#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_5 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_7) v_prenex_6) (select (select |#memory_int| v_prenex_4) v_prenex_5))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:00,485 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 205#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_5 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_7) v_prenex_6) (select (select |#memory_int| v_prenex_4) v_prenex_5))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:00,485 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_5 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_7) v_prenex_6) (select (select |#memory_int| v_prenex_4) v_prenex_5))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:00,486 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 214#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:40:00,486 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 138#(<= 0 main_~i~0) [2019-10-07 00:40:00,486 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 185#(and (<= 0 main_~i~0) (<= 200000 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:00,486 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:00,487 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:00,487 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 219#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:00,487 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 180#(<= 0 main_~i~0) [2019-10-07 00:40:00,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:40:00,488 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 190#(and (< main_~x~0 200000) (<= 0 main_~i~0) (<= 200000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:00,489 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 96#true [2019-10-07 00:40:00,489 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 195#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_5 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_7) v_prenex_6) (select (select |#memory_int| v_prenex_4) v_prenex_5))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:40:00,769 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:40:00,770 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 16 [2019-10-07 00:40:00,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 00:40:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 00:40:00,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-10-07 00:40:00,774 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2019-10-07 00:40:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:40:01,229 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-07 00:40:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 00:40:01,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-10-07 00:40:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:40:01,234 INFO L225 Difference]: With dead ends: 45 [2019-10-07 00:40:01,234 INFO L226 Difference]: Without dead ends: 32 [2019-10-07 00:40:01,235 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:40:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-07 00:40:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-10-07 00:40:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 00:40:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-07 00:40:01,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2019-10-07 00:40:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:40:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-07 00:40:01,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 00:40:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-07 00:40:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 00:40:01,254 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:40:01,254 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:40:01,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:01,456 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:40:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:40:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1611920692, now seen corresponding path program 2 times [2019-10-07 00:40:01,456 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:40:01,457 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:01,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:01,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:40:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:40:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:40:01,642 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:01,642 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:40:01,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:01,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:40:01,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:40:01,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:40:01,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:40:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:40:01,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:40:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:40:01,876 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:40:01,878 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:40:01,880 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:40:01,880 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:40:01,881 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:40:01,881 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:40:01,926 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:40:02,667 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:40:02,681 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:40:02,687 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:40:02,688 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:40:02,688 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 200#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_14) v_prenex_13)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:02,689 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 205#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_14) v_prenex_13)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:02,689 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_14) v_prenex_13)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:02,691 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 214#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:40:02,691 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 138#(<= 0 main_~i~0) [2019-10-07 00:40:02,692 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 185#(and (<= 0 main_~i~0) (<= 200000 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:02,692 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:02,692 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:02,692 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 219#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:02,693 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 180#(<= 0 main_~i~0) [2019-10-07 00:40:02,693 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:40:02,693 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 190#(and (< main_~x~0 200000) (<= 0 main_~i~0) (<= 200000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:02,693 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 96#true [2019-10-07 00:40:02,694 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 195#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_14) v_prenex_13)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) [2019-10-07 00:40:02,977 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:40:02,978 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-07 00:40:02,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:40:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:40:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:40:02,981 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 23 states. [2019-10-07 00:40:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:40:03,826 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2019-10-07 00:40:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:40:03,827 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-10-07 00:40:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:40:03,828 INFO L225 Difference]: With dead ends: 75 [2019-10-07 00:40:03,828 INFO L226 Difference]: Without dead ends: 56 [2019-10-07 00:40:03,830 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 00:40:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-07 00:40:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-07 00:40:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-07 00:40:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-07 00:40:03,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 25 [2019-10-07 00:40:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:40:03,841 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-07 00:40:03,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:40:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-07 00:40:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 00:40:03,843 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:40:03,843 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:40:04,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:04,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:40:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:40:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1819326220, now seen corresponding path program 3 times [2019-10-07 00:40:04,049 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:40:04,049 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:04,049 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:04,050 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:40:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:40:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:40:04,269 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:04,269 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:40:04,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:04,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:40:04,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:40:04,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:40:04,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:40:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:40:04,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:40:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:40:04,653 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:40:04,655 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:40:04,656 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:40:04,658 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:40:04,658 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:40:04,659 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:40:04,713 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:40:05,412 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:40:05,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:40:05,430 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:40:05,431 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:40:05,431 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 200#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_18 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:05,431 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 205#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_18 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:05,432 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_18 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:05,432 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 214#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:40:05,432 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 138#(<= 0 main_~i~0) [2019-10-07 00:40:05,432 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 185#(and (<= 0 main_~i~0) (<= 200000 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:05,433 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:05,433 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:05,433 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 219#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:05,433 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 180#(<= 0 main_~i~0) [2019-10-07 00:40:05,434 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:40:05,434 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 190#(and (< main_~x~0 200000) (<= 0 main_~i~0) (<= 200000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:05,434 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 96#true [2019-10-07 00:40:05,434 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 195#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_18 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:40:05,890 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:40:05,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-07 00:40:05,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:40:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:40:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:40:05,893 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 35 states. [2019-10-07 00:40:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:40:07,574 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2019-10-07 00:40:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-07 00:40:07,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-10-07 00:40:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:40:07,576 INFO L225 Difference]: With dead ends: 123 [2019-10-07 00:40:07,576 INFO L226 Difference]: Without dead ends: 92 [2019-10-07 00:40:07,580 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=979, Invalid=3053, Unknown=0, NotChecked=0, Total=4032 [2019-10-07 00:40:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-07 00:40:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-10-07 00:40:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-07 00:40:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-10-07 00:40:07,602 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 43 [2019-10-07 00:40:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:40:07,606 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-10-07 00:40:07,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:40:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-10-07 00:40:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-07 00:40:07,609 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:40:07,609 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:40:07,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:07,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:40:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:40:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1941864564, now seen corresponding path program 4 times [2019-10-07 00:40:07,827 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:40:07,828 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:07,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:07,829 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:40:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:40:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:40:08,371 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:08,371 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:40:08,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:40:08,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:40:08,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:40:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:40:08,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:40:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:40:09,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:40:09,226 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:40:09,226 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:40:09,226 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:40:09,226 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:40:09,227 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:40:09,248 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:40:09,423 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-07 00:40:09,749 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:40:09,761 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:40:09,765 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:40:09,766 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:40:09,766 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 200#(and (exists ((v_prenex_27 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_25 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_26) (select (select |#memory_int| v_prenex_25) v_prenex_28)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:09,766 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 205#(and (exists ((v_prenex_27 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_25 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_26) (select (select |#memory_int| v_prenex_25) v_prenex_28)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:09,767 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (exists ((v_prenex_27 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_25 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_26) (select (select |#memory_int| v_prenex_25) v_prenex_28)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:40:09,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 214#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:40:09,767 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 138#(<= 0 main_~i~0) [2019-10-07 00:40:09,768 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 185#(and (<= 0 main_~i~0) (<= 200000 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:09,768 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:09,769 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:09,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 219#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:40:09,770 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 180#(<= 0 main_~i~0) [2019-10-07 00:40:09,771 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:40:09,771 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 190#(and (< main_~x~0 200000) (<= 0 main_~i~0) (<= 200000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (not (< main_~i~0 200000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:40:09,772 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 96#true [2019-10-07 00:40:09,772 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 195#(exists ((v_prenex_27 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_25 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_26) (select (select |#memory_int| v_prenex_25) v_prenex_28)))))) [2019-10-07 00:40:10,186 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:40:10,186 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-07 00:40:10,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-07 00:40:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-07 00:40:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2216, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:40:10,191 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 59 states. [2019-10-07 00:40:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:40:13,891 INFO L93 Difference]: Finished difference Result 219 states and 296 transitions. [2019-10-07 00:40:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-07 00:40:13,892 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 79 [2019-10-07 00:40:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:40:13,894 INFO L225 Difference]: With dead ends: 219 [2019-10-07 00:40:13,894 INFO L226 Difference]: Without dead ends: 164 [2019-10-07 00:40:13,900 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3607, Invalid=8825, Unknown=0, NotChecked=0, Total=12432 [2019-10-07 00:40:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-07 00:40:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2019-10-07 00:40:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-07 00:40:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2019-10-07 00:40:13,922 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 79 [2019-10-07 00:40:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:40:13,923 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2019-10-07 00:40:13,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-07 00:40:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2019-10-07 00:40:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-07 00:40:13,927 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:40:13,927 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:40:14,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:40:14,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:40:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:40:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 908120204, now seen corresponding path program 5 times [2019-10-07 00:40:14,133 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:40:14,133 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:14,134 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:14,134 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:40:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:40:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:40:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:40:15,581 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:40:15,581 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:40:15,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true