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-examples/standard_copy7_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:42:09,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:42:09,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:42:09,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:42:09,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:42:09,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:42:09,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:42:09,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:42:09,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:42:09,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:42:09,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:42:09,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:42:09,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:42:09,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:42:09,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:42:09,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:42:09,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:42:09,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:42:09,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:42:09,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:42:09,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:42:09,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:42:09,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:42:09,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:42:09,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:42:09,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:42:09,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:42:09,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:42:09,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:42:09,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:42:09,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:42:09,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:42:09,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:42:09,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:42:09,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:42:09,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:42:09,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:42:09,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:42:09,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:42:09,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:42:09,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:42:09,673 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-06 23:42:09,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:42:09,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:42:09,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:42:09,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:42:09,714 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:42:09,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:42:09,715 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:42:09,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:42:09,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:42:09,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:42:09,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:42:09,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:42:09,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:42:09,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:42:09,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:42:09,720 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:42:09,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:42:09,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:42:09,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:42:09,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:42:09,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:42:09,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:42:09,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:42:09,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:42:09,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:42:09,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:42:09,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:42:09,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:42:09,723 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-06 23:42:10,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:42:10,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:42:10,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:42:10,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:42:10,020 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:42:10,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_ground-2.i [2019-10-06 23:42:10,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ea6d43c/c5dc3e6418db4c7a8fd38fbe36b78177/FLAG57dcfec64 [2019-10-06 23:42:10,610 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:42:10,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_ground-2.i [2019-10-06 23:42:10,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ea6d43c/c5dc3e6418db4c7a8fd38fbe36b78177/FLAG57dcfec64 [2019-10-06 23:42:10,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ea6d43c/c5dc3e6418db4c7a8fd38fbe36b78177 [2019-10-06 23:42:10,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:42:10,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:42:10,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:42:10,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:42:10,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:42:10,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:42:10" (1/1) ... [2019-10-06 23:42:10,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df8c864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:10, skipping insertion in model container [2019-10-06 23:42:10,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:42:10" (1/1) ... [2019-10-06 23:42:10,999 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:42:11,019 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:42:11,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:42:11,209 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:42:11,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:42:11,260 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:42:11,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11 WrapperNode [2019-10-06 23:42:11,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:42:11,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:42:11,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:42:11,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:42:11,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (1/1) ... [2019-10-06 23:42:11,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:42:11,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:42:11,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:42:11,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:42:11,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (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-06 23:42:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:42:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:42:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:42:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:42:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:42:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:42:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:42:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:42:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:42:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:42:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:42:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:42:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:42:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:42:12,126 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:42:12,126 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-06 23:42:12,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:42:12 BoogieIcfgContainer [2019-10-06 23:42:12,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:42:12,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:42:12,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:42:12,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:42:12,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:42:10" (1/3) ... [2019-10-06 23:42:12,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393ca53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:42:12, skipping insertion in model container [2019-10-06 23:42:12,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:42:11" (2/3) ... [2019-10-06 23:42:12,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393ca53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:42:12, skipping insertion in model container [2019-10-06 23:42:12,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:42:12" (3/3) ... [2019-10-06 23:42:12,142 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy7_ground-2.i [2019-10-06 23:42:12,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:42:12,164 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:42:12,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:42:12,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:42:12,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:42:12,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:42:12,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:42:12,214 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:42:12,214 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:42:12,214 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:42:12,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:42:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-06 23:42:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:42:12,238 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:12,239 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:12,241 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash -830930063, now seen corresponding path program 1 times [2019-10-06 23:42:12,254 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:12,254 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,255 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,255 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:12,439 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-06 23:42:12,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,440 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:42:12,441 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:42:12,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:42:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:42:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:42:12,463 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-06 23:42:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:12,498 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-06 23:42:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:42:12,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-06 23:42:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:12,509 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:42:12,509 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:42:12,513 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-06 23:42:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:42:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-06 23:42:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:42:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-06 23:42:12,553 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2019-10-06 23:42:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:12,553 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-06 23:42:12,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:42:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-10-06 23:42:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:42:12,555 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:12,555 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:12,555 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 323741192, now seen corresponding path program 1 times [2019-10-06 23:42:12,556 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:12,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:42:12,625 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,625 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:42:12,626 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:42:12,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:42:12,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:42:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:42:12,629 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-10-06 23:42:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:12,693 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-06 23:42:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:42:12,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-06 23:42:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:12,695 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:42:12,695 INFO L226 Difference]: Without dead ends: 30 [2019-10-06 23:42:12,696 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-06 23:42:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-06 23:42:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-06 23:42:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-06 23:42:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-06 23:42:12,704 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 19 [2019-10-06 23:42:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:12,704 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-06 23:42:12,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:42:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-06 23:42:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:42:12,706 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:12,707 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:12,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 55637449, now seen corresponding path program 1 times [2019-10-06 23:42:12,708 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:12,708 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:42:12,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:12,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:12,859 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-06 23:42:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:12,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:42:12,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:42:12,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:42:13,040 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:13,064 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:13,064 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:13,071 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:13,079 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:13,080 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:13,236 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:14,013 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:42:14,267 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:42:15,350 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:42:15,455 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:15,472 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:15,477 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:15,477 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:15,478 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:15,478 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~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|)))))) [2019-10-06 23:42:15,479 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,479 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __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) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~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|)))))) [2019-10-06 23:42:15,479 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __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) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~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|)))))) [2019-10-06 23:42:15,480 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:15,480 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,480 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,480 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:15,481 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-06 23:42:15,481 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-06 23:42:15,481 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,481 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:15,482 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:15,482 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,482 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~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|))))) [2019-10-06 23:42:15,482 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,483 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:15,483 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:15,830 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:15,831 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:42:15,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:42:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:42:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:42:15,838 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 17 states. [2019-10-06 23:42:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:16,540 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-10-06 23:42:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:42:16,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-06 23:42:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:16,544 INFO L225 Difference]: With dead ends: 65 [2019-10-06 23:42:16,544 INFO L226 Difference]: Without dead ends: 42 [2019-10-06 23:42:16,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:42:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-06 23:42:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-10-06 23:42:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:42:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-06 23:42:16,563 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2019-10-06 23:42:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:16,564 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-06 23:42:16,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:42:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-10-06 23:42:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-06 23:42:16,567 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:16,567 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:16,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:16,773 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -937280896, now seen corresponding path program 2 times [2019-10-06 23:42:16,774 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:16,774 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:16,774 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:16,774 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:42:16,918 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:16,918 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:16,919 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-06 23:42:17,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:42:17,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:42:17,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:42:17,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-06 23:42:17,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-06 23:42:17,060 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:17,062 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:17,064 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:17,064 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:17,065 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:17,065 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:17,100 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:17,657 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:42:18,720 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:18,727 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:18,731 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:18,731 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:18,731 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:18,732 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:18,732 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,732 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:18,732 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:18,732 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:18,733 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,733 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,733 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:18,733 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-06 23:42:18,734 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-06 23:42:18,734 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,734 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:18,734 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:18,734 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,735 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) [2019-10-06 23:42:18,736 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:18,736 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:18,736 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:19,084 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:19,085 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-06 23:42:19,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-06 23:42:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-06 23:42:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:42:19,086 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 21 states. [2019-10-06 23:42:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:20,149 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-10-06 23:42:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:42:20,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-10-06 23:42:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:20,150 INFO L225 Difference]: With dead ends: 87 [2019-10-06 23:42:20,150 INFO L226 Difference]: Without dead ends: 64 [2019-10-06 23:42:20,155 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:42:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-06 23:42:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-06 23:42:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:42:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-06 23:42:20,173 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 29 [2019-10-06 23:42:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:20,173 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-06 23:42:20,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-06 23:42:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-06 23:42:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-06 23:42:20,175 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:20,176 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:20,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:20,380 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2083393800, now seen corresponding path program 3 times [2019-10-06 23:42:20,381 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:20,382 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:20,382 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:20,382 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:20,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:20,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:20,534 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-06 23:42:20,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:42:20,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:42:20,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:42:20,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:20,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:20,723 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:20,725 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:20,725 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:20,726 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:20,726 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:20,726 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:20,767 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:21,245 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:42:22,282 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:22,296 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:22,299 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:22,300 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:22,300 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:22,300 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~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-06 23:42:22,301 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:22,301 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:22,301 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:22,301 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,302 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,302 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:22,302 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-06 23:42:22,302 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,302 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-06 23:42:22,302 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:22,303 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:22,303 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,303 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~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-06 23:42:22,303 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,304 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:22,304 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:22,601 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:22,602 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:42:22,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:42:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:42:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:42:22,605 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 25 states. [2019-10-06 23:42:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:23,473 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2019-10-06 23:42:23,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:42:23,474 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2019-10-06 23:42:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:23,475 INFO L225 Difference]: With dead ends: 115 [2019-10-06 23:42:23,475 INFO L226 Difference]: Without dead ends: 71 [2019-10-06 23:42:23,480 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:42:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-06 23:42:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-10-06 23:42:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-06 23:42:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-10-06 23:42:23,500 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 51 [2019-10-06 23:42:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:23,500 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-10-06 23:42:23,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:42:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-10-06 23:42:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-06 23:42:23,504 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:23,504 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:23,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:23,709 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -683194895, now seen corresponding path program 4 times [2019-10-06 23:42:23,710 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:23,710 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:23,711 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:23,711 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:23,886 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:23,886 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:23,886 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-06 23:42:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:24,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:42:24,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:24,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:24,265 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:24,266 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:24,267 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:24,267 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:24,267 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:24,268 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:24,287 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:25,214 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:42:25,874 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:25,880 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:25,884 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:25,885 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:25,885 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:25,885 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:25,885 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,885 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:25,886 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:25,886 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:25,886 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,886 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,886 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:25,887 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-06 23:42:25,887 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,887 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-06 23:42:25,887 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:25,887 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:25,888 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,888 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) [2019-10-06 23:42:25,888 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:25,888 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:25,888 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:26,193 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:26,194 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:42:26,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:42:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:42:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:42:26,197 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 39 states. [2019-10-06 23:42:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:27,705 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2019-10-06 23:42:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:42:27,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2019-10-06 23:42:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:27,707 INFO L225 Difference]: With dead ends: 129 [2019-10-06 23:42:27,707 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:42:27,710 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:42:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:42:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-10-06 23:42:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:42:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-10-06 23:42:27,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 58 [2019-10-06 23:42:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:27,730 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-10-06 23:42:27,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:42:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-10-06 23:42:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-06 23:42:27,732 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:27,732 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:27,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:27,933 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1665183215, now seen corresponding path program 5 times [2019-10-06 23:42:27,934 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:27,934 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:27,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:27,935 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:42:28,402 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:28,402 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:28,402 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 [2019-10-06 23:42:28,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:42:28,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:42:28,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:42:28,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-10-06 23:42:28,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-10-06 23:42:28,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:28,837 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:28,838 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:28,838 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:28,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:28,838 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:28,857 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:30,343 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:30,348 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:30,351 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:30,351 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:30,352 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:30,352 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:30,352 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,352 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:30,353 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-06 23:42:30,353 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,353 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:30,354 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:30,777 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:30,778 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-06 23:42:30,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-06 23:42:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-06 23:42:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:42:30,782 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 49 states. [2019-10-06 23:42:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:33,850 INFO L93 Difference]: Finished difference Result 172 states and 230 transitions. [2019-10-06 23:42:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-06 23:42:33,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2019-10-06 23:42:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:33,853 INFO L225 Difference]: With dead ends: 172 [2019-10-06 23:42:33,853 INFO L226 Difference]: Without dead ends: 128 [2019-10-06 23:42:33,856 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-06 23:42:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-06 23:42:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2019-10-06 23:42:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-06 23:42:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-10-06 23:42:33,871 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 72 [2019-10-06 23:42:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:33,871 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-10-06 23:42:33,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-06 23:42:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-10-06 23:42:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-06 23:42:33,873 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:33,874 INFO L385 BasicCegarLoop]: trace histogram [27, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:34,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:34,077 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1819489656, now seen corresponding path program 6 times [2019-10-06 23:42:34,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:34,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:34,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:34,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:34,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:34,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:34,765 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:34,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:42:34,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:42:34,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:42:34,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:35,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:35,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:35,980 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:35,981 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:35,982 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:35,983 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:35,983 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:36,001 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:36,480 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:42:36,768 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:42:37,408 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:42:37,725 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:42:37,781 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:37,789 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:37,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:37,793 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:37,794 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:37,794 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:37,794 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,795 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:37,795 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:37,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:37,796 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,796 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,796 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:37,796 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-06 23:42:37,797 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,797 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-06 23:42:37,797 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:37,797 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:37,798 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,798 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) [2019-10-06 23:42:37,798 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:37,799 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:37,799 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:38,463 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:38,463 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:42:38,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:42:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:42:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:42:38,467 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 69 states. [2019-10-06 23:42:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:41,853 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2019-10-06 23:42:41,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:42:41,855 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 115 [2019-10-06 23:42:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:41,857 INFO L225 Difference]: With dead ends: 243 [2019-10-06 23:42:41,857 INFO L226 Difference]: Without dead ends: 157 [2019-10-06 23:42:41,862 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:42:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-06 23:42:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2019-10-06 23:42:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-06 23:42:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-10-06 23:42:41,880 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 115 [2019-10-06 23:42:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:41,881 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-10-06 23:42:41,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:42:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-10-06 23:42:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-06 23:42:41,883 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:41,883 INFO L385 BasicCegarLoop]: trace histogram [56, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:42,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:42,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 413638417, now seen corresponding path program 7 times [2019-10-06 23:42:42,089 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:42,089 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:42,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:42,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:43,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:43,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:42:43,518 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:42:43,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:42:43,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:42:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:43,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:42:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:42:47,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:42:47,390 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:42:47,390 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:42:47,391 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:42:47,391 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:42:47,391 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:42:47,411 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:42:48,787 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:42:48,799 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:42:48,804 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:42:48,804 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:42:48,804 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:42:48,805 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:48,805 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,805 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:48,806 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:42:48,806 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:42:48,806 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,807 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,807 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:48,807 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-06 23:42:48,807 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,808 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-06 23:42:48,808 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:42:48,808 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:42:48,809 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,809 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:42:48,809 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:48,809 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:42:48,810 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:42:49,728 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:42:49,728 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:42:49,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:42:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:42:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:42:49,741 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 127 states. [2019-10-06 23:42:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:59,621 INFO L93 Difference]: Finished difference Result 301 states and 374 transitions. [2019-10-06 23:42:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:42:59,623 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 144 [2019-10-06 23:42:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:59,630 INFO L225 Difference]: With dead ends: 301 [2019-10-06 23:42:59,630 INFO L226 Difference]: Without dead ends: 215 [2019-10-06 23:42:59,639 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:42:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-06 23:42:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2019-10-06 23:42:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-06 23:42:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2019-10-06 23:42:59,677 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 144 [2019-10-06 23:42:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:59,682 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2019-10-06 23:42:59,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:42:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2019-10-06 23:42:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-06 23:42:59,693 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:59,693 INFO L385 BasicCegarLoop]: trace histogram [114, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:59,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:59,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 197757553, now seen corresponding path program 8 times [2019-10-06 23:42:59,898 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:59,898 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:59,898 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:59,898 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6940 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-06 23:43:05,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:05,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:05,000 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:11,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:44:11,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:11,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-06 23:44:11,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6940 backedges. 124 proven. 55 refuted. 0 times theorem prover too weak. 6761 trivial. 0 not checked. [2019-10-06 23:44:12,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6940 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 6865 trivial. 0 not checked. [2019-10-06 23:44:12,898 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:12,899 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:44:12,900 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:12,900 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:12,900 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:12,901 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:12,931 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:14,343 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:14,349 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:14,351 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:14,352 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:14,352 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:44:14,352 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a8~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_8|) |v_main_~#a8~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:14,352 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,352 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a8~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_8|) |v_main_~#a8~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 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-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a8~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_8|) |v_main_~#a8~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 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-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:14,353 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-06 23:44:14,353 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,354 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-06 23:44:14,354 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:44:14,354 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:14,354 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,354 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a8~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_8|) |v_main_~#a8~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:44:14,354 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:14,355 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:14,355 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:15,207 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:15,207 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 15, 13, 11] total 151 [2019-10-06 23:44:15,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-10-06 23:44:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-10-06 23:44:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7231, Invalid=15419, Unknown=0, NotChecked=0, Total=22650 [2019-10-06 23:44:15,213 INFO L87 Difference]: Start difference. First operand 206 states and 214 transitions. Second operand 151 states. [2019-10-06 23:44:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:31,326 INFO L93 Difference]: Finished difference Result 386 states and 486 transitions. [2019-10-06 23:44:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-10-06 23:44:31,326 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 202 [2019-10-06 23:44:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:31,330 INFO L225 Difference]: With dead ends: 386 [2019-10-06 23:44:31,330 INFO L226 Difference]: Without dead ends: 300 [2019-10-06 23:44:31,332 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17945 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=21792, Invalid=66120, Unknown=0, NotChecked=0, Total=87912 [2019-10-06 23:44:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-06 23:44:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2019-10-06 23:44:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-06 23:44:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 299 transitions. [2019-10-06 23:44:31,355 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 299 transitions. Word has length 202 [2019-10-06 23:44:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:31,355 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 299 transitions. [2019-10-06 23:44:31,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-10-06 23:44:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 299 transitions. [2019-10-06 23:44:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-06 23:44:31,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:31,360 INFO L385 BasicCegarLoop]: trace histogram [115, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:31,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:31,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1423364536, now seen corresponding path program 9 times [2019-10-06 23:44:31,574 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:31,574 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:31,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:31,575 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8441 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:44:37,181 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:37,182 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:37,182 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:37,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:44:37,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:37,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:44:37,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8441 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:44:37,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8441 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:44:52,716 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:52,718 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:44:52,718 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:52,718 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:52,718 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:52,718 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:52,735 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:54,042 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:54,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:54,052 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:54,052 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:54,052 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:44:54,052 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a8~0.base_BEFORE_CALL_9| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_9|) |v_main_~#a8~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_35) v_prenex_36)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:54,053 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a8~0.base_BEFORE_CALL_9| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_9|) |v_main_~#a8~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_35) v_prenex_36)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:54,053 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a8~0.base_BEFORE_CALL_9| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_9|) |v_main_~#a8~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_35) v_prenex_36)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:54,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:54,053 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,054 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,054 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:54,054 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-06 23:44:54,054 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,054 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a8~0.base_BEFORE_CALL_9| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_9|) |v_main_~#a8~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_35) v_prenex_36)))))) [2019-10-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,055 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:54,056 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:54,925 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:54,925 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:44:54,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:44:54,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:44:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:44:54,931 INFO L87 Difference]: Start difference. First operand 291 states and 299 transitions. Second operand 245 states. [2019-10-06 23:45:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:45:29,630 INFO L93 Difference]: Finished difference Result 587 states and 719 transitions. [2019-10-06 23:45:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:45:29,631 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 287 [2019-10-06 23:45:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:45:29,634 INFO L225 Difference]: With dead ends: 587 [2019-10-06 23:45:29,634 INFO L226 Difference]: Without dead ends: 417 [2019-10-06 23:45:29,640 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:45:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-10-06 23:45:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 408. [2019-10-06 23:45:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-06 23:45:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 416 transitions. [2019-10-06 23:45:29,663 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 416 transitions. Word has length 287 [2019-10-06 23:45:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:45:29,664 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 416 transitions. [2019-10-06 23:45:29,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:45:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 416 transitions. [2019-10-06 23:45:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-06 23:45:29,671 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:45:29,671 INFO L385 BasicCegarLoop]: trace histogram [232, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:45:29,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:45:29,885 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:45:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:45:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash 845133777, now seen corresponding path program 10 times [2019-10-06 23:45:29,886 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:45:29,886 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:45:29,886 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:45:29,886 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:45:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:45:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:45:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28799 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:45:50,161 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:45:50,161 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:45:50,161 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:45:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:45:50,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:45:50,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:45:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 28799 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:45:51,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:46:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 28799 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:46:50,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:46:50,652 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:46:50,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:46:50,652 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:46:50,653 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:46:50,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:46:50,686 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:46:52,083 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:46:52,095 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:46:52,097 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:46:52,098 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:46:52,098 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-06 23:46:52,098 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a8~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_39) (select (select |#memory_int| v_prenex_38) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_10|) |v_main_~#a8~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:52,098 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a8~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_39) (select (select |#memory_int| v_prenex_38) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_10|) |v_main_~#a8~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:52,098 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a8~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_39) (select (select |#memory_int| v_prenex_38) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_10|) |v_main_~#a8~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:52,099 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-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,099 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-06 23:46:52,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(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-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a8~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_39) (select (select |#memory_int| v_prenex_38) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_10|) |v_main_~#a8~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a8~0.base|) (+ (* 4 main_~x~0) |main_~#a8~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:53,668 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:46:53,669 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:46:53,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:46:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:46:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:46:53,690 INFO L87 Difference]: Start difference. First operand 408 states and 416 transitions. Second operand 479 states. [2019-10-06 23:49:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:49:06,409 INFO L93 Difference]: Finished difference Result 821 states and 1070 transitions. [2019-10-06 23:49:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:49:06,409 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 404 [2019-10-06 23:49:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:49:06,413 INFO L225 Difference]: With dead ends: 821 [2019-10-06 23:49:06,413 INFO L226 Difference]: Without dead ends: 651 [2019-10-06 23:49:06,425 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1920 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 203.7s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:49:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-06 23:49:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 642. [2019-10-06 23:49:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-06 23:49:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 650 transitions. [2019-10-06 23:49:06,458 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 650 transitions. Word has length 404 [2019-10-06 23:49:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:49:06,459 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 650 transitions. [2019-10-06 23:49:06,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:49:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 650 transitions. [2019-10-06 23:49:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-10-06 23:49:06,464 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:49:06,465 INFO L385 BasicCegarLoop]: trace histogram [466, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:49:06,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:49:06,671 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:49:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:49:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1073573839, now seen corresponding path program 11 times [2019-10-06 23:49:06,672 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:49:06,672 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:49:06,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:06,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:49:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:50:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 110582 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-06 23:50:27,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:50:27,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:50:27,486 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true