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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:40:56,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:40:56,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:40:56,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:40:56,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:40:56,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:40:56,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:40:56,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:40:56,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:40:56,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:40:56,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:40:56,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:40:56,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:40:56,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:40:56,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:40:56,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:40:56,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:40:56,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:40:56,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:40:56,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:40:56,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:40:56,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:40:56,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:40:56,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:40:56,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:40:56,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:40:56,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:40:56,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:40:56,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:40:56,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:40:56,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:40:56,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:40:56,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:40:56,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:40:56,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:40:56,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:40:56,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:40:56,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:40:56,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:40:56,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:40:56,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:40:56,081 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:40:56,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:40:56,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:40:56,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:40:56,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:40:56,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:40:56,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:40:56,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:40:56,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:40:56,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:40:56,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:40:56,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:40:56,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:40:56,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:40:56,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:40:56,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:40:56,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:40:56,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:40:56,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:40:56,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:40:56,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:40:56,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:40:56,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:40:56,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:40:56,101 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:40:56,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:40:56,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:40:56,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:40:56,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:40:56,407 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:40:56,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_ground-1.i [2019-10-06 23:40:56,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cb8e5b2/3dd5ad32adad4f91a75408f7504ada86/FLAGa9f36a26f [2019-10-06 23:40:56,920 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:40:56,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_ground-1.i [2019-10-06 23:40:56,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cb8e5b2/3dd5ad32adad4f91a75408f7504ada86/FLAGa9f36a26f [2019-10-06 23:40:57,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cb8e5b2/3dd5ad32adad4f91a75408f7504ada86 [2019-10-06 23:40:57,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:40:57,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:40:57,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:40:57,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:40:57,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:40:57,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ba53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57, skipping insertion in model container [2019-10-06 23:40:57,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,326 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:40:57,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:40:57,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:40:57,548 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:40:57,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:40:57,596 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:40:57,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57 WrapperNode [2019-10-06 23:40:57,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:40:57,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:40:57,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:40:57,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:40:57,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... [2019-10-06 23:40:57,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:40:57,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:40:57,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:40:57,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:40:57,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:40:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:40:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:40:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:40:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:40:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:40:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:40:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:40:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:40:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:40:58,384 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:40:58,384 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-06 23:40:58,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:40:58 BoogieIcfgContainer [2019-10-06 23:40:58,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:40:58,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:40:58,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:40:58,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:40:58,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:40:57" (1/3) ... [2019-10-06 23:40:58,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc07fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:40:58, skipping insertion in model container [2019-10-06 23:40:58,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:57" (2/3) ... [2019-10-06 23:40:58,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc07fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:40:58, skipping insertion in model container [2019-10-06 23:40:58,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:40:58" (3/3) ... [2019-10-06 23:40:58,402 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy7_ground-1.i [2019-10-06 23:40:58,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:40:58,421 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:40:58,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:40:58,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:40:58,465 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:40:58,465 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:40:58,465 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:40:58,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:40:58,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:40:58,466 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:40:58,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:40:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-06 23:40:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:40:58,487 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:58,488 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:40:58,489 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1960828359, now seen corresponding path program 1 times [2019-10-06 23:40:58,501 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:58,501 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:58,501 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:58,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:58,683 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:40:58,684 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:58,685 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:40:58,685 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:40:58,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:40:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:40:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:40:58,711 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-06 23:40:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:58,759 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-06 23:40:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:40:58,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-06 23:40:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:58,777 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:40:58,777 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:40:58,780 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:40:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:40:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-06 23:40:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:40:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-06 23:40:58,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2019-10-06 23:40:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:58,817 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-06 23:40:58,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:40:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-10-06 23:40:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:40:58,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:58,819 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:40:58,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash 204960146, now seen corresponding path program 1 times [2019-10-06 23:40:58,820 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:58,821 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:58,821 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:58,821 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:58,928 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:40:58,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:58,929 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:40:58,929 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:40:58,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:40:58,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:40:58,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:40:58,932 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-10-06 23:40:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:59,020 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-06 23:40:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:40:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-06 23:40:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:59,023 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:40:59,023 INFO L226 Difference]: Without dead ends: 30 [2019-10-06 23:40:59,025 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:40:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-06 23:40:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-06 23:40:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-06 23:40:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-06 23:40:59,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 19 [2019-10-06 23:40:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:59,041 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-06 23:40:59,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:40:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-06 23:40:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:40:59,043 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:59,044 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:40:59,044 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:59,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1587201211, now seen corresponding path program 1 times [2019-10-06 23:40:59,045 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:59,045 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:59,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:59,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:59,182 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:40:59,182 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:59,182 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:59,182 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:40:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:59,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:40:59,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:59,309 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:40:59,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:59,356 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:40:59,357 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:59,402 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:40:59,403 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:59,409 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:59,417 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:59,418 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:59,556 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:00,139 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:41:00,653 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:41:00,908 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:41:01,613 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:41:01,699 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:01,708 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:01,712 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:01,713 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:01,713 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:01,713 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:01,714 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,714 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:01,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:01,714 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,714 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,715 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,715 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:41:01,715 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:41:01,715 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:01,716 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:01,716 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:01,716 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,716 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:01,717 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:01,717 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:01,717 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:02,020 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:02,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:41:02,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:41:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:41:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:41:02,023 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 18 states. [2019-10-06 23:41:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:02,780 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2019-10-06 23:41:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:41:02,781 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-06 23:41:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:02,782 INFO L225 Difference]: With dead ends: 72 [2019-10-06 23:41:02,783 INFO L226 Difference]: Without dead ends: 49 [2019-10-06 23:41:02,784 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:41:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-06 23:41:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-10-06 23:41:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:41:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-06 23:41:02,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 26 [2019-10-06 23:41:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:02,794 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-06 23:41:02,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:41:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-06 23:41:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-06 23:41:02,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:02,796 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:03,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:03,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:03,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1965201305, now seen corresponding path program 2 times [2019-10-06 23:41:03,005 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:03,006 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:03,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:03,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:03,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:41:03,212 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:03,212 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:03,212 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:41:03,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:41:03,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:41:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:41:03,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:41:03,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:41:03,362 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:03,366 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:03,367 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:03,367 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:03,368 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:03,368 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:03,421 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:03,901 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:41:04,193 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:41:05,233 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:05,240 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:05,243 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:05,243 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:05,244 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:05,244 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:05,244 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,244 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:05,245 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:05,245 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,245 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,245 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,245 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:41:05,246 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:41:05,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:05,246 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:05,246 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:05,247 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:05,248 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:05,248 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:05,249 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:05,504 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:05,504 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:41:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:41:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:41:05,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:41:05,507 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 19 states. [2019-10-06 23:41:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:06,311 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2019-10-06 23:41:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:41:06,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-10-06 23:41:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:06,313 INFO L225 Difference]: With dead ends: 104 [2019-10-06 23:41:06,313 INFO L226 Difference]: Without dead ends: 77 [2019-10-06 23:41:06,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:41:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-06 23:41:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-10-06 23:41:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-06 23:41:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-10-06 23:41:06,334 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 36 [2019-10-06 23:41:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:06,335 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-10-06 23:41:06,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:41:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-10-06 23:41:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-06 23:41:06,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:06,341 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:06,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:06,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash -412271143, now seen corresponding path program 3 times [2019-10-06 23:41:06,543 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:06,543 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:06,543 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:06,544 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-06 23:41:06,806 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:06,806 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:06,806 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:41:06,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:41:06,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:41:06,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:41:06,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-06 23:41:06,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-06 23:41:07,057 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:07,061 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:07,061 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:07,062 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:07,062 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:07,063 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:07,086 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:08,535 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:08,542 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:08,545 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:08,545 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:08,545 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:08,545 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:08,546 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,546 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:08,546 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:08,546 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,546 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,547 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,547 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:41:08,547 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:41:08,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:08,547 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:08,548 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:08,548 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,548 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,548 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:08,548 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:08,549 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:08,549 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:08,860 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:08,861 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-06 23:41:08,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:41:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:41:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:41:08,863 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 29 states. [2019-10-06 23:41:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:10,172 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2019-10-06 23:41:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-06 23:41:10,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-10-06 23:41:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:10,175 INFO L225 Difference]: With dead ends: 148 [2019-10-06 23:41:10,175 INFO L226 Difference]: Without dead ends: 90 [2019-10-06 23:41:10,177 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:41:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-06 23:41:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-10-06 23:41:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-06 23:41:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-10-06 23:41:10,190 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 64 [2019-10-06 23:41:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:10,190 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-10-06 23:41:10,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:41:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-10-06 23:41:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-06 23:41:10,192 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:10,192 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:10,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:10,394 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1445740364, now seen corresponding path program 4 times [2019-10-06 23:41:10,396 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:10,396 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:10,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:10,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-06 23:41:10,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:10,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:10,569 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:41:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:10,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:41:10,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-06 23:41:10,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-06 23:41:10,963 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:10,966 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:10,966 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:10,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:10,967 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:10,967 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:10,984 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:12,491 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:12,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:12,498 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:12,498 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:12,498 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:12,498 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:12,499 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,499 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:12,499 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:12,499 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,500 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,500 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,500 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:41:12,500 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:41:12,500 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:12,501 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:12,502 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:12,502 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:12,790 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:12,791 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-06 23:41:12,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:41:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:41:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:41:12,793 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 35 states. [2019-10-06 23:41:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:14,024 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2019-10-06 23:41:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:41:14,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-06 23:41:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:14,026 INFO L225 Difference]: With dead ends: 167 [2019-10-06 23:41:14,027 INFO L226 Difference]: Without dead ends: 102 [2019-10-06 23:41:14,029 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:41:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-06 23:41:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2019-10-06 23:41:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-06 23:41:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2019-10-06 23:41:14,042 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 77 [2019-10-06 23:41:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2019-10-06 23:41:14,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:41:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2019-10-06 23:41:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-06 23:41:14,044 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:14,045 INFO L385 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:14,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:14,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 210288116, now seen corresponding path program 5 times [2019-10-06 23:41:14,251 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:14,251 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:14,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:14,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-06 23:41:14,618 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:14,618 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:14,618 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:41:23,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:41:23,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:41:23,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-06 23:41:23,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-06 23:41:23,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-06 23:41:23,997 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:23,998 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:23,998 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:23,999 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:23,999 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:23,999 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:24,015 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:25,399 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:25,405 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:25,408 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:25,408 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:25,408 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:25,408 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,409 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,410 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:41:25,410 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:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,410 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:25,411 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:25,411 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:25,411 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:25,847 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:25,848 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 11, 11] total 54 [2019-10-06 23:41:25,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-06 23:41:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-06 23:41:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2319, Unknown=0, NotChecked=0, Total=2862 [2019-10-06 23:41:25,851 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 54 states. [2019-10-06 23:41:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:29,078 INFO L93 Difference]: Finished difference Result 231 states and 310 transitions. [2019-10-06 23:41:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:41:29,079 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 89 [2019-10-06 23:41:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:29,080 INFO L225 Difference]: With dead ends: 231 [2019-10-06 23:41:29,081 INFO L226 Difference]: Without dead ends: 166 [2019-10-06 23:41:29,084 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1681, Invalid=8621, Unknown=0, NotChecked=0, Total=10302 [2019-10-06 23:41:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-06 23:41:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-10-06 23:41:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-06 23:41:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2019-10-06 23:41:29,103 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 89 [2019-10-06 23:41:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:29,104 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2019-10-06 23:41:29,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-06 23:41:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2019-10-06 23:41:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-06 23:41:29,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:29,107 INFO L385 BasicCegarLoop]: trace histogram [23, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:29,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:29,313 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1540306482, now seen corresponding path program 6 times [2019-10-06 23:41:29,314 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:29,314 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:29,315 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:29,315 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:29,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:29,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:29,853 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:41:30,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:41:30,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:41:30,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:41:30,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:30,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:30,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:30,791 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:30,791 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:30,791 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:30,792 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:30,792 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:30,807 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:32,252 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:32,262 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:32,264 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:32,264 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:32,264 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:32,264 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:32,264 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,265 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:32,265 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:32,265 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,265 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,265 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,266 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:41:32,266 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:41:32,266 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:32,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:32,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:32,267 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,267 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,267 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:32,267 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:32,267 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:32,268 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:32,628 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:32,629 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-06 23:41:32,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:41:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:41:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:41:32,633 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 61 states. [2019-10-06 23:41:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:35,259 INFO L93 Difference]: Finished difference Result 319 states and 359 transitions. [2019-10-06 23:41:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-06 23:41:35,259 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 153 [2019-10-06 23:41:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:35,262 INFO L225 Difference]: With dead ends: 319 [2019-10-06 23:41:35,262 INFO L226 Difference]: Without dead ends: 191 [2019-10-06 23:41:35,266 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-06 23:41:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-06 23:41:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2019-10-06 23:41:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-06 23:41:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 190 transitions. [2019-10-06 23:41:35,287 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 190 transitions. Word has length 153 [2019-10-06 23:41:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:35,288 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 190 transitions. [2019-10-06 23:41:35,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:41:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 190 transitions. [2019-10-06 23:41:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-06 23:41:35,291 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:35,291 INFO L385 BasicCegarLoop]: trace histogram [48, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:35,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:35,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1436211655, now seen corresponding path program 7 times [2019-10-06 23:41:35,497 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:35,497 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:35,498 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:35,498 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2128 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:36,717 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:36,717 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:36,717 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:41:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:37,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:41:37,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2128 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:37,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2128 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:39,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:39,988 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:41:39,988 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:39,988 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:39,988 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:39,989 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:40,005 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:41,245 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:41:41,458 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:41:41,547 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:41,557 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:41,560 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:41,560 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:41,561 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-06 23:41:41,561 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(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:41:41,561 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,561 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(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:41:41,562 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:41,562 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,562 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,562 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,562 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:41:41,562 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:41:41,564 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:41:41,564 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:41:41,564 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:41,564 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,564 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,565 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(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:41:41,565 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:41:41,565 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem19| (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:41:41,565 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(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:41:42,124 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:42,125 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-06 23:41:42,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:41:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:41:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:41:42,131 INFO L87 Difference]: Start difference. First operand 182 states and 190 transitions. Second operand 111 states. [2019-10-06 23:41:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:41:49,569 INFO L93 Difference]: Finished difference Result 369 states and 434 transitions. [2019-10-06 23:41:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-06 23:41:49,570 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 178 [2019-10-06 23:41:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:41:49,575 INFO L225 Difference]: With dead ends: 369 [2019-10-06 23:41:49,575 INFO L226 Difference]: Without dead ends: 241 [2019-10-06 23:41:49,588 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-06 23:41:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-06 23:41:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 232. [2019-10-06 23:41:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-06 23:41:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 240 transitions. [2019-10-06 23:41:49,627 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 240 transitions. Word has length 178 [2019-10-06 23:41:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:41:49,628 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 240 transitions. [2019-10-06 23:41:49,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:41:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 240 transitions. [2019-10-06 23:41:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-06 23:41:49,639 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:41:49,639 INFO L385 BasicCegarLoop]: trace histogram [98, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:41:49,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:41:49,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:41:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:41:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1403634599, now seen corresponding path program 8 times [2019-10-06 23:41:49,846 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:41:49,846 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:49,847 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:49,847 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:41:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:41:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-06 23:41:53,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:53,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:53,837 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