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_two_index_08.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:31,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:31,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:31,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:31,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:31,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:31,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:31,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:31,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:31,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:31,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:31,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:31,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:31,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:31,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:31,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:31,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:31,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:31,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:31,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:31,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:31,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:31,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:31,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:31,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:31,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:31,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:31,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:31,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:31,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:31,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:31,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:31,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:31,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:31,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:31,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:31,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:31,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:31,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:31,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:31,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:31,927 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:36:31,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:31,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:31,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:31,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:31,952 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:31,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:31,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:31,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:31,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:31,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:31,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:31,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:31,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:31,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:31,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:31,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:31,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:31,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:31,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:31,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:31,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:31,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:31,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:31,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:31,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:31,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:31,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:31,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:31,959 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:36:32,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:32,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:32,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:32,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:32,328 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:32,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-13 21:36:32,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3af109a/7b8f6fca438e4716b5e9127f626b60f7/FLAG2f1e162f1 [2019-10-13 21:36:32,855 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:32,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-13 21:36:32,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3af109a/7b8f6fca438e4716b5e9127f626b60f7/FLAG2f1e162f1 [2019-10-13 21:36:33,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3af109a/7b8f6fca438e4716b5e9127f626b60f7 [2019-10-13 21:36:33,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:33,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:33,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:33,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:33,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:33,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33, skipping insertion in model container [2019-10-13 21:36:33,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,295 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:33,314 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:33,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:33,550 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:33,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:33,597 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:33,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33 WrapperNode [2019-10-13 21:36:33,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:33,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:33,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:33,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:33,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (1/1) ... [2019-10-13 21:36:33,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:33,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:33,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:33,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:33,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (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:36:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:34,066 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:34,067 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:34,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:34 BoogieIcfgContainer [2019-10-13 21:36:34,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:34,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:34,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:34,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:34,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:33" (1/3) ... [2019-10-13 21:36:34,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:34, skipping insertion in model container [2019-10-13 21:36:34,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:33" (2/3) ... [2019-10-13 21:36:34,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:34, skipping insertion in model container [2019-10-13 21:36:34,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:34" (3/3) ... [2019-10-13 21:36:34,078 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_08.i [2019-10-13 21:36:34,090 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:34,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:34,119 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:34,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:34,184 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:34,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:34,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:34,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:34,185 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:34,185 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:34,185 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:36:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:36:34,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:34,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:34,220 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-13 21:36:34,245 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:34,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659147333] [2019-10-13 21:36:34,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:34,425 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:36:34,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659147333] [2019-10-13 21:36:34,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:34,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:34,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401871236] [2019-10-13 21:36:34,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:34,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:34,462 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:36:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:34,508 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:36:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:34,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:36:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:34,519 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:36:34,519 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:36:34,523 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:36:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:36:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:36:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:36:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:36:34,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:36:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:34,563 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:36:34,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:36:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:34,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:34,564 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:34,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-13 21:36:34,566 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:34,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322224313] [2019-10-13 21:36:34,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:34,625 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:36:34,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322224313] [2019-10-13 21:36:34,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:34,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:34,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67156473] [2019-10-13 21:36:34,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:34,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:34,629 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:36:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:34,665 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 21:36:34,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:34,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:36:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:34,669 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:36:34,669 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:36:34,671 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:36:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:36:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-13 21:36:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:34,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:34,682 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:34,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:34,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:34,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:34,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-13 21:36:34,684 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:34,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545111498] [2019-10-13 21:36:34,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:34,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545111498] [2019-10-13 21:36:34,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713509311] [2019-10-13 21:36:34,767 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:36:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:34,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:34,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:34,891 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:34,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [142531375] [2019-10-13 21:36:34,952 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:34,952 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:34,959 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:34,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:34,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:35,135 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:35,632 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-13 21:36:35,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:35,770 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:35,782 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:35,783 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:35,783 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:35,783 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:35,784 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:35,784 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:35,784 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:35,784 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 32) |main_~#b~0.offset| 4)) |main_#t~mem3|) (<= main_~j~0 0)) [2019-10-13 21:36:35,785 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:36:35,785 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:36:35,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:35,786 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:35,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:35,786 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:35,787 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-13 21:36:36,093 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:36,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:36:36,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073780646] [2019-10-13 21:36:36,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:36:36,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:36:36,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:36:36,099 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:36:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:36,850 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-13 21:36:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:36:36,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:36:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:36,853 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:36:36,853 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:36:36,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 21:36:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:36:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-13 21:36:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:36,870 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:36:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:36,870 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:36,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:36:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:36,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:36,872 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:37,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:37,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-13 21:36:37,080 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:37,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221739003] [2019-10-13 21:36:37,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:37,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:37,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:37,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221739003] [2019-10-13 21:36:37,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941374064] [2019-10-13 21:36:37,171 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:36:37,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:36:37,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:37,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:36:37,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:37,248 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:37,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264233712] [2019-10-13 21:36:37,294 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:37,294 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:37,295 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:37,295 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:37,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:37,333 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:37,674 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:37,692 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:37,697 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:37,697 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:37,698 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:37,698 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:37,698 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:37,698 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:37,699 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:37,699 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 32) |main_~#b~0.offset| 4)) |main_#t~mem3|) (<= main_~j~0 0)) [2019-10-13 21:36:37,699 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:36:37,699 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:36:37,700 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:37,700 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:37,700 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:37,700 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:37,700 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-13 21:36:38,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:38,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-13 21:36:38,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197728338] [2019-10-13 21:36:38,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:36:38,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:38,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:36:38,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:36:38,005 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-13 21:36:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:38,998 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-13 21:36:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:36:39,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-13 21:36:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:39,002 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:36:39,002 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:36:39,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:36:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:36:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-13 21:36:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:36:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:36:39,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-13 21:36:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:39,029 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:36:39,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:36:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:36:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:36:39,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:39,031 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:39,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:39,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-13 21:36:39,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:39,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359721674] [2019-10-13 21:36:39,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:39,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:39,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:39,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359721674] [2019-10-13 21:36:39,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547509187] [2019-10-13 21:36:39,384 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:36:39,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:39,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:39,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:36:39,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:39,592 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:39,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1752307928] [2019-10-13 21:36:39,789 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:39,790 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:39,790 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:39,791 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:39,791 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:39,843 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:40,179 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:40,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:40,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:40,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:40,203 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:40,204 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:40,205 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~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:36:40,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:40,205 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:40,205 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 32) |main_~#b~0.offset| 4)) |main_#t~mem3|) (<= main_~j~0 0)) [2019-10-13 21:36:40,206 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:36:40,206 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:36:40,206 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:40,206 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~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:36:40,207 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:40,208 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:40,211 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:36:40,497 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:40,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 39 [2019-10-13 21:36:40,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422601409] [2019-10-13 21:36:40,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:36:40,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:36:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=995, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:36:40,500 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-13 21:36:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:42,417 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2019-10-13 21:36:42,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:36:42,417 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-13 21:36:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:42,418 INFO L225 Difference]: With dead ends: 108 [2019-10-13 21:36:42,419 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:36:42,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1816, Invalid=4990, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 21:36:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:36:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2019-10-13 21:36:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 21:36:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-13 21:36:42,437 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2019-10-13 21:36:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:42,437 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-13 21:36:42,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:36:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-13 21:36:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:36:42,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:42,439 INFO L380 BasicCegarLoop]: trace histogram [26, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:42,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:42,649 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1394133595, now seen corresponding path program 4 times [2019-10-13 21:36:42,650 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:42,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72421007] [2019-10-13 21:36:42,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:36:42,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72421007] [2019-10-13 21:36:42,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488159138] [2019-10-13 21:36:42,921 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:36:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:43,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:36:43,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-13 21:36:43,218 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-13 21:36:43,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1327354037] [2019-10-13 21:36:43,816 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:43,817 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:43,817 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:43,817 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:43,818 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:43,851 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:44,119 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:44,127 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:44,131 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:44,132 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:44,132 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,132 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:44,132 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:44,133 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:44,133 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 32) |main_~#b~0.offset| 4)) |main_#t~mem3|) (<= main_~j~0 0)) [2019-10-13 21:36:44,133 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:36:44,134 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:36:44,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:44,134 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:44,134 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:44,135 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:36:44,509 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:44,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 29, 29, 11] total 75 [2019-10-13 21:36:44,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271778149] [2019-10-13 21:36:44,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-13 21:36:44,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-13 21:36:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2233, Invalid=3317, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 21:36:44,515 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 75 states. [2019-10-13 21:36:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:49,624 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2019-10-13 21:36:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-13 21:36:49,626 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 49 [2019-10-13 21:36:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:49,628 INFO L225 Difference]: With dead ends: 169 [2019-10-13 21:36:49,628 INFO L226 Difference]: Without dead ends: 148 [2019-10-13 21:36:49,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9281 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7837, Invalid=17923, Unknown=0, NotChecked=0, Total=25760 [2019-10-13 21:36:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-13 21:36:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2019-10-13 21:36:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-13 21:36:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-13 21:36:49,655 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 49 [2019-10-13 21:36:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:49,655 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-13 21:36:49,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-13 21:36:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-13 21:36:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:36:49,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:49,658 INFO L380 BasicCegarLoop]: trace histogram [62, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:49,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:49,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1422778532, now seen corresponding path program 5 times [2019-10-13 21:36:49,864 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:49,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372200648] [2019-10-13 21:36:49,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:49,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:49,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:36:50,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372200648] [2019-10-13 21:36:50,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210175614] [2019-10-13 21:36:50,207 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:37:07,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-13 21:37:07,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:07,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-13 21:37:07,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:37:08,006 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:37:08,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2117449373] [2019-10-13 21:37:08,386 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:37:08,386 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:08,386 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:08,387 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:08,387 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:08,412 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:08,664 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:37:08,672 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:08,675 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:08,675 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:08,676 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:08,676 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:08,676 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:08,676 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:08,677 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:37:08,677 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 32) |main_~#b~0.offset| 4)) |main_#t~mem3|) (<= main_~j~0 0)) [2019-10-13 21:37:08,677 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:37:08,677 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:37:08,677 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:37:08,678 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:08,678 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:08,678 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:37:08,678 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:37:08,962 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:08,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 47 [2019-10-13 21:37:08,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568266604] [2019-10-13 21:37:08,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-13 21:37:08,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-13 21:37:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=1396, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:37:08,966 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2019-10-13 21:37:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:13,119 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2019-10-13 21:37:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-13 21:37:13,123 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-10-13 21:37:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:13,125 INFO L225 Difference]: With dead ends: 227 [2019-10-13 21:37:13,126 INFO L226 Difference]: Without dead ends: 218 [2019-10-13 21:37:13,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4206, Invalid=10556, Unknown=0, NotChecked=0, Total=14762 [2019-10-13 21:37:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-13 21:37:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 112. [2019-10-13 21:37:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 21:37:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-10-13 21:37:13,157 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 90 [2019-10-13 21:37:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:13,158 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-10-13 21:37:13,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-13 21:37:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-10-13 21:37:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:37:13,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:13,162 INFO L380 BasicCegarLoop]: trace histogram [62, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:13,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:13,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1547036028, now seen corresponding path program 6 times [2019-10-13 21:37:13,366 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:13,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410468386] [2019-10-13 21:37:13,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:13,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:13,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:37:14,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410468386] [2019-10-13 21:37:14,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439669376] [2019-10-13 21:37:14,061 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:37:14,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:14,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:14,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-13 21:37:14,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-13 21:37:14,757 INFO L321 TraceCheckSpWp]: Computing backward predicates...