java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy7_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:37,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:37,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:37,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:37,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:37,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:37,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:37,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:37,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:37,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:37,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:37,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:37,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:37,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:37,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:37,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:37,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:37,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:37,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:37,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:37,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:37,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:37,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:37,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:37,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:37,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:37,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:37,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:37,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:37,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:37,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:37,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:37,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:37,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:37,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:37,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:37,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:37,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:37,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:37,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:37,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:37,907 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-13 21:33:37,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:37,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:37,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:37,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:37,924 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:37,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:37,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:37,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:37,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:37,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:37,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:37,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:37,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:37,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:37,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:37,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:37,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:37,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:37,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:37,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:37,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:37,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:37,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:37,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:37,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:37,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:37,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:37,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:37,929 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-13 21:33:38,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:38,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:38,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:38,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:38,259 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:38,260 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_ground-2.i [2019-10-13 21:33:38,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bab9070c/dbffa398df03410ca82c8a587cf129f0/FLAG6fb798683 [2019-10-13 21:33:38,758 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:38,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_ground-2.i [2019-10-13 21:33:38,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bab9070c/dbffa398df03410ca82c8a587cf129f0/FLAG6fb798683 [2019-10-13 21:33:39,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bab9070c/dbffa398df03410ca82c8a587cf129f0 [2019-10-13 21:33:39,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:39,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:39,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:39,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:39,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:39,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be43138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39, skipping insertion in model container [2019-10-13 21:33:39,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,217 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:39,237 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:39,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:39,482 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:39,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:39,533 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:39,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39 WrapperNode [2019-10-13 21:33:39,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:39,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:39,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:39,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:39,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (1/1) ... [2019-10-13 21:33:39,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:39,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:39,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:39,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:39,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (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-13 21:33:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:40,386 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:40,387 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 21:33:40,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:40 BoogieIcfgContainer [2019-10-13 21:33:40,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:40,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:40,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:40,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:39" (1/3) ... [2019-10-13 21:33:40,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a0a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:40, skipping insertion in model container [2019-10-13 21:33:40,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (2/3) ... [2019-10-13 21:33:40,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a0a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:40, skipping insertion in model container [2019-10-13 21:33:40,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:40" (3/3) ... [2019-10-13 21:33:40,399 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy7_ground-2.i [2019-10-13 21:33:40,411 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:40,422 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:40,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:40,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:40,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:40,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:40,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:40,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:40,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:40,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:40,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-13 21:33:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:40,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,506 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,508 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -830930063, now seen corresponding path program 1 times [2019-10-13 21:33:40,521 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008881319] [2019-10-13 21:33:40,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,708 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-13 21:33:40,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008881319] [2019-10-13 21:33:40,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:40,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:40,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002776543] [2019-10-13 21:33:40,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:40,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:40,735 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-13 21:33:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,773 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-13 21:33:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:40,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:33:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,784 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:33:40,784 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:33:40,788 INFO L600 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-13 21:33:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:33:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 21:33:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:33:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-13 21:33:40,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2019-10-13 21:33:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,830 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-13 21:33:40,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-10-13 21:33:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:33:40,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,832 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 323741192, now seen corresponding path program 1 times [2019-10-13 21:33:40,833 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75153097] [2019-10-13 21:33:40,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,897 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-13 21:33:40,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75153097] [2019-10-13 21:33:40,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:40,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:40,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247688968] [2019-10-13 21:33:40,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:40,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:40,902 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-10-13 21:33:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,966 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-13 21:33:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:40,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:33:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,968 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:33:40,968 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 21:33:40,969 INFO L600 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-13 21:33:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 21:33:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 21:33:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:33:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-13 21:33:40,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 19 [2019-10-13 21:33:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,978 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-13 21:33:40,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-13 21:33:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:33:40,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,980 INFO L380 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-13 21:33:40,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash 55637449, now seen corresponding path program 1 times [2019-10-13 21:33:40,982 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355547602] [2019-10-13 21:33:40,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,122 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-13 21:33:41,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355547602] [2019-10-13 21:33:41,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195422417] [2019-10-13 21:33:41,123 INFO L94 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-13 21:33:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:41,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:41,276 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-13 21:33:41,276 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:41,340 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-13 21:33:41,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [133054061] [2019-10-13 21:33:41,370 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:41,371 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:41,378 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:41,386 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:41,387 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:41,584 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:42,699 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:43,781 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:43,793 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:43,798 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:43,798 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:43,799 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:33:43,799 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,799 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,799 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,800 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:43,800 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,800 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,800 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:43,801 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,801 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-13 21:33:43,801 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-13 21:33:43,801 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,802 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,802 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:43,802 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,802 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:33:43,803 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,803 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:43,803 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,125 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:44,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:44,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832177103] [2019-10-13 21:33:44,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:44,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:44,134 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 18 states. [2019-10-13 21:33:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,897 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2019-10-13 21:33:44,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:44,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-13 21:33:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,900 INFO L225 Difference]: With dead ends: 72 [2019-10-13 21:33:44,900 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:33:44,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 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-13 21:33:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:33:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-10-13 21:33:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:33:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 21:33:44,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 26 [2019-10-13 21:33:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:44,917 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 21:33:44,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 21:33:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 21:33:44,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:44,919 INFO L380 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-13 21:33:45,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -718878255, now seen corresponding path program 2 times [2019-10-13 21:33:45,126 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:45,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493293791] [2019-10-13 21:33:45,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,263 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-13 21:33:45,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493293791] [2019-10-13 21:33:45,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343017359] [2019-10-13 21:33:45,264 INFO L92 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-13 21:33:45,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:45,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:45,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:45,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:45,375 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-13 21:33:45,375 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:45,406 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-13 21:33:45,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585215718] [2019-10-13 21:33:45,409 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:45,409 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:45,411 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:45,411 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:45,412 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:45,442 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:45,763 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:46,018 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:47,042 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:47,058 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:47,074 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:47,074 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:47,074 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:33:47,074 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,075 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,075 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,075 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:47,075 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,075 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,076 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,076 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,077 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-13 21:33:47,077 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-13 21:33:47,077 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:47,078 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) [2019-10-13 21:33:47,078 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,078 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,078 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:47,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:47,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559986280] [2019-10-13 21:33:47,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:47,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:47,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:47,342 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 19 states. [2019-10-13 21:33:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:48,122 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2019-10-13 21:33:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:48,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-10-13 21:33:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:48,127 INFO L225 Difference]: With dead ends: 104 [2019-10-13 21:33:48,127 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 21:33:48,128 INFO L600 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-13 21:33:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 21:33:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-10-13 21:33:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:33:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-10-13 21:33:48,141 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 36 [2019-10-13 21:33:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:48,142 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-10-13 21:33:48,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-10-13 21:33:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:33:48,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:48,144 INFO L380 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-13 21:33:48,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:48,351 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -310643951, now seen corresponding path program 3 times [2019-10-13 21:33:48,352 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:48,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959831272] [2019-10-13 21:33:48,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:48,516 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-13 21:33:48,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959831272] [2019-10-13 21:33:48,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158447273] [2019-10-13 21:33:48,517 INFO L92 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-13 21:33:48,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:48,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:48,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:48,666 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-13 21:33:48,667 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:48,727 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-13 21:33:48,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594427185] [2019-10-13 21:33:48,730 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:48,730 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:48,730 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:48,731 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:48,731 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:48,753 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:50,243 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:50,249 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:50,252 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:50,252 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:50,253 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:33:50,253 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,253 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,253 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:50,254 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,254 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,254 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,254 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,255 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-13 21:33:50,255 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,255 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-13 21:33:50,255 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,255 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:50,256 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,256 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:50,256 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,256 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,256 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,523 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:50,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:33:50,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957041580] [2019-10-13 21:33:50,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:50,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:50,527 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 23 states. [2019-10-13 21:33:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:51,314 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2019-10-13 21:33:51,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:33:51,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-10-13 21:33:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:51,316 INFO L225 Difference]: With dead ends: 141 [2019-10-13 21:33:51,317 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:33:51,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:33:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:33:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-10-13 21:33:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-13 21:33:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2019-10-13 21:33:51,332 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 64 [2019-10-13 21:33:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:51,333 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2019-10-13 21:33:51,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2019-10-13 21:33:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:33:51,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:51,335 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:51,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:51,536 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -995152975, now seen corresponding path program 4 times [2019-10-13 21:33:51,537 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:51,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345901457] [2019-10-13 21:33:51,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345901457] [2019-10-13 21:33:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139471736] [2019-10-13 21:33:51,696 INFO L92 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-13 21:33:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:51,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:51,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:51,838 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:52,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [37188871] [2019-10-13 21:33:52,047 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:52,047 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:52,048 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:52,048 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:52,048 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:52,066 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:53,507 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:53,512 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:53,515 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:53,515 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:53,515 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:33:53,515 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,515 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:53,516 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,516 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-13 21:33:53,517 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,517 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-13 21:33:53,517 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:53,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:53,518 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,518 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) [2019-10-13 21:33:53,518 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,519 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:53,519 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,833 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:53,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:33:53,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461614556] [2019-10-13 21:33:53,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:33:53,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:33:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:53,837 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 35 states. [2019-10-13 21:33:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:55,051 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-10-13 21:33:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:33:55,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-10-13 21:33:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:55,053 INFO L225 Difference]: With dead ends: 153 [2019-10-13 21:33:55,054 INFO L226 Difference]: Without dead ends: 95 [2019-10-13 21:33:55,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 190 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-13 21:33:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-13 21:33:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2019-10-13 21:33:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 21:33:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-10-13 21:33:55,069 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 70 [2019-10-13 21:33:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:55,069 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-10-13 21:33:55,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:33:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-10-13 21:33:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:33:55,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:55,071 INFO L380 BasicCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:55,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:55,275 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash -192891663, now seen corresponding path program 5 times [2019-10-13 21:33:55,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:55,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716045259] [2019-10-13 21:33:55,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:55,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:55,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:55,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716045259] [2019-10-13 21:33:55,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718787157] [2019-10-13 21:33:55,685 INFO L92 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-13 21:33:56,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:56,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:56,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:33:57,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-10-13 21:33:57,126 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 21:33:57,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968680313] [2019-10-13 21:33:57,276 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:57,276 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:57,277 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:57,277 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:57,277 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:57,291 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:57,696 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:58,657 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:58,665 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:58,668 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:58,668 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:58,668 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:33:58,668 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,669 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,670 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,670 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-13 21:33:58,670 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,670 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-13 21:33:58,671 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:58,671 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:58,671 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,671 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:58,671 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,672 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,672 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,060 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:59,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 9, 11] total 50 [2019-10-13 21:33:59,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768342044] [2019-10-13 21:33:59,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-13 21:33:59,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-13 21:33:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1986, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:33:59,064 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 50 states. [2019-10-13 21:34:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:01,881 INFO L93 Difference]: Finished difference Result 210 states and 282 transitions. [2019-10-13 21:34:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:34:01,882 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 82 [2019-10-13 21:34:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:01,883 INFO L225 Difference]: With dead ends: 210 [2019-10-13 21:34:01,883 INFO L226 Difference]: Without dead ends: 152 [2019-10-13 21:34:01,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1399, Invalid=7343, Unknown=0, NotChecked=0, Total=8742 [2019-10-13 21:34:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-13 21:34:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2019-10-13 21:34:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-13 21:34:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2019-10-13 21:34:01,904 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 82 [2019-10-13 21:34:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:01,904 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2019-10-13 21:34:01,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-13 21:34:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2019-10-13 21:34:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:34:01,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:01,907 INFO L380 BasicCegarLoop]: trace histogram [23, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:02,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:02,111 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash -257703672, now seen corresponding path program 6 times [2019-10-13 21:34:02,112 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:02,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471504628] [2019-10-13 21:34:02,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:02,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471504628] [2019-10-13 21:34:02,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090708965] [2019-10-13 21:34:02,674 INFO L92 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-13 21:34:02,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:02,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:02,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:34:02,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:02,963 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:03,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356780865] [2019-10-13 21:34:03,669 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:34:03,670 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:03,670 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:03,670 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:03,671 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:03,688 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:04,354 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:05,087 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:05,092 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:05,095 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:05,095 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:05,095 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:34:05,095 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:05,096 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,097 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:05,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:05,097 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,097 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,098 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:05,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (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-13 21:34:05,098 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-13 21:34:05,098 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,099 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:05,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:05,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:05,099 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,099 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:34:05,100 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,100 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:05,100 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:05,465 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:05,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:34:05,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6749430] [2019-10-13 21:34:05,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:34:05,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:34:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:34:05,469 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 61 states. [2019-10-13 21:34:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:08,085 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2019-10-13 21:34:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:34:08,086 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 139 [2019-10-13 21:34:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:08,088 INFO L225 Difference]: With dead ends: 291 [2019-10-13 21:34:08,088 INFO L226 Difference]: Without dead ends: 177 [2019-10-13 21:34:08,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:34:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-13 21:34:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2019-10-13 21:34:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-13 21:34:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2019-10-13 21:34:08,126 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 139 [2019-10-13 21:34:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:08,126 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2019-10-13 21:34:08,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:34:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2019-10-13 21:34:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:34:08,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:08,129 INFO L380 BasicCegarLoop]: trace histogram [48, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:08,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:08,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -832549679, now seen corresponding path program 7 times [2019-10-13 21:34:08,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:08,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590036991] [2019-10-13 21:34:08,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:08,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:08,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:09,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590036991] [2019-10-13 21:34:09,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990427070] [2019-10-13 21:34:09,543 INFO L92 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-13 21:34:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:09,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:34:09,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:09,889 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-13 21:34:13,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119621308] [2019-10-13 21:34:13,375 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:34:13,376 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:13,376 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:13,376 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:13,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:13,389 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:14,777 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:14,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:14,787 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:14,787 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 21:34:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 389#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 394#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,788 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 403#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 374#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:14,789 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 399#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,789 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-13 21:34:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,790 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-13 21:34:14,790 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 408#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:14,790 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,790 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 384#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.base_BEFORE_CALL_7| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25)))) (and (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_7|) |v_main_~#a8~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:34:14,791 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,791 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 379#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem18|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:14,791 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:15,292 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:15,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-13 21:34:15,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136029053] [2019-10-13 21:34:15,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:34:15,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:34:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:34:15,299 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 111 states.