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_compareModified_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:49,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:49,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:49,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:49,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:49,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:49,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:49,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:49,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:49,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:49,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:49,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:49,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:49,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:49,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:49,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:49,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:49,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:49,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:49,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:49,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:49,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:49,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:49,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:49,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:49,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:49,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:49,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:49,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:49,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:49,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:49,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:49,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:49,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:49,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:49,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:49,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:49,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:49,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:49,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:49,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:49,869 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:32:49,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:49,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:49,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:49,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:49,885 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:49,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:49,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:49,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:49,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:49,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:49,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:49,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:49,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:49,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:49,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:49,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:49,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:49,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:49,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:49,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:49,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:49,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:49,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:49,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:49,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:49,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:49,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:49,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:49,890 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:32:50,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:50,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:50,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:50,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:50,193 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:50,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compareModified_ground.i [2019-10-13 21:32:50,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850024e9e/9bab32fd5c124135a3fe5b919e25db24/FLAG0f1987607 [2019-10-13 21:32:50,680 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:50,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_ground.i [2019-10-13 21:32:50,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850024e9e/9bab32fd5c124135a3fe5b919e25db24/FLAG0f1987607 [2019-10-13 21:32:51,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850024e9e/9bab32fd5c124135a3fe5b919e25db24 [2019-10-13 21:32:51,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:51,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:51,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:51,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:51,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:51,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54268d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51, skipping insertion in model container [2019-10-13 21:32:51,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:51,144 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:51,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:51,358 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:51,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:51,401 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:51,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51 WrapperNode [2019-10-13 21:32:51,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:51,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:51,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:51,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:51,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (1/1) ... [2019-10-13 21:32:51,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:51,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:51,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:51,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:51,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (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:32:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:52,072 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:52,073 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:32:52,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:52 BoogieIcfgContainer [2019-10-13 21:32:52,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:52,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:52,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:52,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:52,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:51" (1/3) ... [2019-10-13 21:32:52,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fafed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:52, skipping insertion in model container [2019-10-13 21:32:52,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:51" (2/3) ... [2019-10-13 21:32:52,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fafed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:52, skipping insertion in model container [2019-10-13 21:32:52,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:52" (3/3) ... [2019-10-13 21:32:52,083 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2019-10-13 21:32:52,092 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:52,101 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:52,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:52,140 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:52,140 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:52,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:52,141 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:52,141 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:52,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:52,141 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:52,141 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-13 21:32:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:52,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:52,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:52,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1944584681, now seen corresponding path program 1 times [2019-10-13 21:32:52,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:52,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927159179] [2019-10-13 21:32:52,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,365 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:32:52,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927159179] [2019-10-13 21:32:52,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:52,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:52,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927563744] [2019-10-13 21:32:52,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:52,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:52,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:52,402 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-13 21:32:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:52,470 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-10-13 21:32:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:52,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:52,488 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:32:52,488 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:32:52,495 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:32:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:32:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:32:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:32:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-13 21:32:52,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2019-10-13 21:32:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:52,563 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-13 21:32:52,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-10-13 21:32:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:52,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:52,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:52,568 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1263030727, now seen corresponding path program 1 times [2019-10-13 21:32:52,570 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:52,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010395822] [2019-10-13 21:32:52,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,674 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:32:52,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010395822] [2019-10-13 21:32:52,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:52,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:52,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259533974] [2019-10-13 21:32:52,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:52,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:52,679 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-10-13 21:32:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:52,699 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-13 21:32:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:52,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:52,701 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:52,702 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:32:52,703 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:32:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:32:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 21:32:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:32:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-13 21:32:52,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2019-10-13 21:32:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:52,717 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-13 21:32:52,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-10-13 21:32:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:32:52,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:52,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:52,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 404770879, now seen corresponding path program 1 times [2019-10-13 21:32:52,723 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:52,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012853718] [2019-10-13 21:32:52,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:52,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,873 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:32:52,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012853718] [2019-10-13 21:32:52,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404482803] [2019-10-13 21:32:52,877 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:32:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:52,996 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:32:52,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:53,040 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:32:53,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325977591] [2019-10-13 21:32:53,088 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:32:53,088 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:53,094 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:53,102 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:53,103 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:53,328 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:57,868 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:32:57,888 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:57,897 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:57,898 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:57,898 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 106#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 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_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|) (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_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,899 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 111#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 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_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|) (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_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_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:32:57,899 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 120#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:57,899 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 91#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:57,900 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 86#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:32:57,900 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 81#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:32:57,900 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:32:57,900 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:32:57,901 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 96#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:57,901 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 125#(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:32:57,901 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:57,902 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 116#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 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_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|) (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_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_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:32:57,902 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 101#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 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_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|) (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_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) [2019-10-13 21:32:57,902 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 62#true [2019-10-13 21:32:58,259 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:58,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 19 [2019-10-13 21:32:58,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699265293] [2019-10-13 21:32:58,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:32:58,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:58,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:32:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:32:58,264 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 19 states. [2019-10-13 21:32:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:59,112 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-13 21:32:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:32:59,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-13 21:32:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:59,115 INFO L225 Difference]: With dead ends: 52 [2019-10-13 21:32:59,115 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:32:59,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 21:32:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:32:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-13 21:32:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:32:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-13 21:32:59,129 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 15 [2019-10-13 21:32:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:59,129 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-13 21:32:59,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:32:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-13 21:32:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:32:59,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:59,131 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:59,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:59,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 251815191, now seen corresponding path program 2 times [2019-10-13 21:32:59,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:59,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246341796] [2019-10-13 21:32:59,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:59,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246341796] [2019-10-13 21:32:59,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248496991] [2019-10-13 21:32:59,443 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:32:59,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:32:59,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:59,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:32:59,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:59,524 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:59,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335372287] [2019-10-13 21:32:59,562 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:32:59,562 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:59,563 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:59,563 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:59,564 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:59,634 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:00,075 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:00,089 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:00,099 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:00,099 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:00,104 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (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|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:00,104 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (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|))))) (<= __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:33:00,104 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:00,105 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:00,105 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:00,105 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:00,106 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:00,106 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:00,106 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:00,106 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:00,106 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:00,107 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (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|))))) (<= __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:33:00,107 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (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|))))) [2019-10-13 21:33:00,107 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:00,405 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:00,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 12] total 20 [2019-10-13 21:33:00,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428055375] [2019-10-13 21:33:00,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 21:33:00,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 21:33:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:33:00,407 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 20 states. [2019-10-13 21:33:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:01,015 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-10-13 21:33:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:33:01,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-10-13 21:33:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:01,017 INFO L225 Difference]: With dead ends: 60 [2019-10-13 21:33:01,017 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:33:01,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:33:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-13 21:33:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:33:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-13 21:33:01,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 19 [2019-10-13 21:33:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-13 21:33:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 21:33:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-13 21:33:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:33:01,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:01,027 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:01,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:01,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 661658391, now seen corresponding path program 3 times [2019-10-13 21:33:01,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:01,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534388924] [2019-10-13 21:33:01,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:01,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:01,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:33:01,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534388924] [2019-10-13 21:33:01,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102318815] [2019-10-13 21:33:01,417 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:01,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:01,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:01,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:01,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:01,563 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:01,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009509978] [2019-10-13 21:33:01,637 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:01,637 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:01,638 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:01,638 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:01,638 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:01,672 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:02,016 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:02,025 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:02,030 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:02,031 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:02,031 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,031 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (<= __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:33:02,032 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:02,032 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:02,032 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:02,033 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:02,033 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,033 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,033 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:02,034 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,034 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:02,034 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (<= __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:33:02,035 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) [2019-10-13 21:33:02,035 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:02,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:02,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 12] total 30 [2019-10-13 21:33:02,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185318246] [2019-10-13 21:33:02,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 21:33:02,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 21:33:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:33:02,529 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 30 states. [2019-10-13 21:33:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:03,766 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2019-10-13 21:33:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:03,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-10-13 21:33:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:03,768 INFO L225 Difference]: With dead ends: 74 [2019-10-13 21:33:03,768 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 21:33:03,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=504, Invalid=2576, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:33:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 21:33:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-13 21:33:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:33:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-13 21:33:03,778 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2019-10-13 21:33:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:03,779 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-13 21:33:03,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 21:33:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-13 21:33:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:33:03,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:03,780 INFO L380 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:03,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:03,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1459515665, now seen corresponding path program 4 times [2019-10-13 21:33:03,985 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:03,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045920333] [2019-10-13 21:33:03,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:33:04,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045920333] [2019-10-13 21:33:04,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573153136] [2019-10-13 21:33:04,137 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:04,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:04,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:04,402 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:04,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [242919262] [2019-10-13 21:33:04,667 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:04,667 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:04,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:04,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:04,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:04,693 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:04,998 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:05,004 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:05,008 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:05,008 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:05,008 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (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|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:05,008 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (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|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:05,009 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:05,009 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:05,009 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:05,009 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:05,009 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:05,010 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:05,010 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:05,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:05,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:05,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (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|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:05,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (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|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) [2019-10-13 21:33:05,011 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:05,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:05,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 12] total 43 [2019-10-13 21:33:05,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913226267] [2019-10-13 21:33:05,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-13 21:33:05,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-13 21:33:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 21:33:05,410 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 43 states. [2019-10-13 21:33:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:07,257 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2019-10-13 21:33:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-13 21:33:07,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 30 [2019-10-13 21:33:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:07,264 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:33:07,265 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:33:07,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1282, Invalid=5360, Unknown=0, NotChecked=0, Total=6642 [2019-10-13 21:33:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:33:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-13 21:33:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 21:33:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-13 21:33:07,283 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 30 [2019-10-13 21:33:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:07,283 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-13 21:33:07,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-13 21:33:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-13 21:33:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:33:07,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:07,285 INFO L380 BasicCegarLoop]: trace histogram [22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:07,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:07,489 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1397621737, now seen corresponding path program 5 times [2019-10-13 21:33:07,490 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:07,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028851596] [2019-10-13 21:33:07,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:07,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028851596] [2019-10-13 21:33:07,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895691197] [2019-10-13 21:33:07,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:08,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:08,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:08,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:33:08,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:08,249 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:08,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077006158] [2019-10-13 21:33:08,357 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:08,357 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:08,358 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:08,358 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:08,358 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:08,392 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:08,698 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:08,706 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:08,709 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:08,709 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:08,710 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,710 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(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_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,710 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:08,710 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,710 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:08,711 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:08,711 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:08,711 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:08,711 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,711 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:08,712 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:08,712 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(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_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,712 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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|)))))) [2019-10-13 21:33:08,712 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:09,026 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:09,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 12] total 32 [2019-10-13 21:33:09,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928505349] [2019-10-13 21:33:09,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:33:09,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:33:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:09,030 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 32 states. [2019-10-13 21:33:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:10,164 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-10-13 21:33:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 21:33:10,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-10-13 21:33:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:10,166 INFO L225 Difference]: With dead ends: 90 [2019-10-13 21:33:10,166 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:33:10,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:33:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:33:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-13 21:33:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 21:33:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-13 21:33:10,179 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 43 [2019-10-13 21:33:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:10,180 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-13 21:33:10,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:33:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-13 21:33:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:33:10,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:10,182 INFO L380 BasicCegarLoop]: trace histogram [22, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:10,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:10,389 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -858856681, now seen corresponding path program 6 times [2019-10-13 21:33:10,389 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:10,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466015637] [2019-10-13 21:33:10,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:10,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466015637] [2019-10-13 21:33:10,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860086392] [2019-10-13 21:33:10,710 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:33:10,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:10,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:10,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:33:10,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-13 21:33:11,246 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-13 21:33:12,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202410612] [2019-10-13 21:33:12,050 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:12,051 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:12,051 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:12,051 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:12,051 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:12,083 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:12,363 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:12,368 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:12,372 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:12,372 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:12,372 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,372 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,373 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,374 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:12,374 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,374 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:12,374 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,375 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) [2019-10-13 21:33:12,375 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:12,893 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:12,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25, 12] total 78 [2019-10-13 21:33:12,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394096170] [2019-10-13 21:33:12,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-13 21:33:12,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-13 21:33:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=4635, Unknown=0, NotChecked=0, Total=6006 [2019-10-13 21:33:12,899 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 78 states. [2019-10-13 21:33:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:16,918 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2019-10-13 21:33:16,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-13 21:33:16,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 53 [2019-10-13 21:33:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:16,920 INFO L225 Difference]: With dead ends: 134 [2019-10-13 21:33:16,921 INFO L226 Difference]: Without dead ends: 95 [2019-10-13 21:33:16,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5653 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5088, Invalid=17864, Unknown=0, NotChecked=0, Total=22952 [2019-10-13 21:33:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-13 21:33:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-10-13 21:33:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-13 21:33:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-10-13 21:33:16,937 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 53 [2019-10-13 21:33:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:16,937 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-10-13 21:33:16,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-13 21:33:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-10-13 21:33:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:33:16,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:16,939 INFO L380 BasicCegarLoop]: trace histogram [46, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:17,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:17,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2083364625, now seen corresponding path program 7 times [2019-10-13 21:33:17,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:17,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494126103] [2019-10-13 21:33:17,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:17,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:17,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:33:17,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494126103] [2019-10-13 21:33:17,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554879130] [2019-10-13 21:33:17,706 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:17,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 21:33:17,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-13 21:33:19,094 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-13 21:33:21,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [486446142] [2019-10-13 21:33:21,922 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:21,923 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:21,923 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:21,923 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:21,924 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:21,951 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:22,262 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:22,267 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:22,270 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:22,270 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:22,270 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,270 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:22,271 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:22,272 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:22,272 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:22,272 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:22,272 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,272 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:22,273 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:22,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:22,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 49, 49, 12] total 127 [2019-10-13 21:33:22,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836268976] [2019-10-13 21:33:22,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-13 21:33:22,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-13 21:33:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4824, Invalid=11178, Unknown=0, NotChecked=0, Total=16002 [2019-10-13 21:33:22,910 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 127 states. [2019-10-13 21:33:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:31,966 INFO L93 Difference]: Finished difference Result 184 states and 243 transitions. [2019-10-13 21:33:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-13 21:33:31,967 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 78 [2019-10-13 21:33:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:31,969 INFO L225 Difference]: With dead ends: 184 [2019-10-13 21:33:31,969 INFO L226 Difference]: Without dead ends: 144 [2019-10-13 21:33:31,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13982 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=16504, Invalid=45746, Unknown=0, NotChecked=0, Total=62250 [2019-10-13 21:33:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-13 21:33:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-10-13 21:33:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-13 21:33:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2019-10-13 21:33:31,988 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 78 [2019-10-13 21:33:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:31,989 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2019-10-13 21:33:31,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-13 21:33:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2019-10-13 21:33:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:33:31,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:31,992 INFO L380 BasicCegarLoop]: trace histogram [94, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,199 INFO L82 PathProgramCache]: Analyzing trace with hash 744568343, now seen corresponding path program 8 times [2019-10-13 21:33:32,200 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400997320] [2019-10-13 21:33:32,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat