java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_07.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:28:19,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:28:19,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:28:19,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:28:19,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:28:19,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:28:19,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:28:19,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:28:19,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:28:19,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:28:19,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:28:19,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:28:19,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:28:19,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:28:19,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:28:19,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:28:19,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:28:19,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:28:19,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:28:19,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:28:19,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:28:19,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:28:19,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:28:19,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:28:19,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:28:19,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:28:19,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:28:19,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:28:19,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:28:19,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:28:19,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:28:19,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:28:19,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:28:19,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:28:19,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:28:19,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:28:19,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:28:19,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:28:19,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:28:19,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:28:19,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:28:19,270 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-07 00:28:19,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:28:19,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:28:19,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:28:19,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:28:19,309 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:28:19,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:28:19,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:28:19,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:28:19,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:28:19,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:28:19,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:28:19,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:28:19,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:28:19,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:28:19,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:28:19,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:28:19,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:28:19,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:28:19,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:28:19,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:28:19,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:28:19,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:28:19,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:28:19,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:28:19,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:28:19,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:28:19,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:28:19,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:28:19,320 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-07 00:28:19,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:28:19,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:28:19,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:28:19,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:28:19,595 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:28:19,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_07.i [2019-10-07 00:28:19,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55badd724/b023411c59ab4593ab7c4420a0108ccb/FLAGb789d9587 [2019-10-07 00:28:20,097 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:28:20,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_07.i [2019-10-07 00:28:20,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55badd724/b023411c59ab4593ab7c4420a0108ccb/FLAGb789d9587 [2019-10-07 00:28:20,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55badd724/b023411c59ab4593ab7c4420a0108ccb [2019-10-07 00:28:20,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:28:20,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:28:20,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:28:20,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:28:20,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:28:20,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202527d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20, skipping insertion in model container [2019-10-07 00:28:20,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,534 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:28:20,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:28:20,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:28:20,724 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:28:20,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:28:20,768 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:28:20,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20 WrapperNode [2019-10-07 00:28:20,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:28:20,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:28:20,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:28:20,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:28:20,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (1/1) ... [2019-10-07 00:28:20,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:28:20,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:28:20,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:28:20,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:28:20,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (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-07 00:28:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:28:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:28:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:28:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:28:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:28:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:28:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:28:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:28:21,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:28:21,259 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:28:21,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:28:21 BoogieIcfgContainer [2019-10-07 00:28:21,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:28:21,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:28:21,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:28:21,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:28:21,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:28:20" (1/3) ... [2019-10-07 00:28:21,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cac66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:28:21, skipping insertion in model container [2019-10-07 00:28:21,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:28:20" (2/3) ... [2019-10-07 00:28:21,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cac66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:28:21, skipping insertion in model container [2019-10-07 00:28:21,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:28:21" (3/3) ... [2019-10-07 00:28:21,268 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_07.i [2019-10-07 00:28:21,276 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:28:21,282 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:28:21,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:28:21,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:28:21,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:28:21,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:28:21,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:28:21,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:28:21,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:28:21,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:28:21,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:28:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:28:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:28:21,335 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:21,336 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:21,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:28:21,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:21,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:21,517 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-07 00:28:21,517 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,518 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:28:21,518 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:28:21,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:28:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:28:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:28:21,546 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:28:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:21,628 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:28:21,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:28:21,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:28:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:21,642 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:28:21,643 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:28:21,648 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:28:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:28:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:28:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:28:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:28:21,700 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:28:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:21,701 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:28:21,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:28:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:28:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:28:21,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:21,704 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:21,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-07 00:28:21,707 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:21,707 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,707 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,707 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:21,814 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-07 00:28:21,815 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,815 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:28:21,815 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:28:21,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:28:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:28:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:28:21,818 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:28:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:21,849 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:28:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:28:21,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:28:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:21,853 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:28:21,853 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:28:21,854 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:28:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:28:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:28:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:28:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:28:21,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:28:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:21,865 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:28:21,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:28:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:28:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:28:21,866 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:21,866 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:21,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:21,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:28:21,867 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:21,867 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,868 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,868 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:21,957 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-07 00:28:21,958 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:21,958 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:22,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:28:22,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:22,074 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-07 00:28:22,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:22,105 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-07 00:28:22,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:22,131 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:22,131 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:22,137 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:22,145 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:22,146 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:22,306 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:22,702 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-07 00:28:22,831 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:22,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:22,876 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:22,876 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:22,876 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:22,877 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:22,877 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:22,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:22,878 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:22,878 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:22,878 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-07 00:28:22,878 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-07 00:28:22,879 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:22,880 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:22,880 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:22,880 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-07 00:28:22,880 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:23,214 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:23,214 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:28:23,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:28:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:28:23,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:28:23,218 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:28:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:23,961 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-07 00:28:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:28:23,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:28:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:23,963 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:28:23,963 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:28:23,964 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:28:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:28:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-07 00:28:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:28:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:28:23,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:28:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:23,972 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:28:23,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:28:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:28:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:28:23,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:23,974 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:24,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:24,178 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-07 00:28:24,180 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:24,180 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:24,180 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:24,181 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:28:24,286 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:24,286 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:24,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:24,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:28:24,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:24,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:28:24,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:28:24,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:28:24,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:24,444 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:24,444 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:24,444 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:24,445 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:24,445 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:24,496 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:24,821 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:24,839 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:24,845 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:24,845 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:24,845 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:24,846 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:24,846 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:24,846 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:24,847 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:24,847 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:24,848 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-07 00:28:24,848 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-07 00:28:24,848 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:24,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:24,849 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:24,850 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-07 00:28:24,865 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:25,173 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:25,173 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-07 00:28:25,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:28:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:28:25,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:28:25,175 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-07 00:28:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:26,093 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-07 00:28:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:28:26,094 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-07 00:28:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:26,095 INFO L225 Difference]: With dead ends: 73 [2019-10-07 00:28:26,095 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:28:26,097 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:28:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:28:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-07 00:28:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:28:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:28:26,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-07 00:28:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:26,107 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:28:26,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:28:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:28:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:28:26,108 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:26,108 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:26,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:26,321 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-07 00:28:26,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:26,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:26,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:26,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:28:26,487 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:26,487 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:26,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:26,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:28:26,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:26,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:28:26,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:28:26,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:28:26,782 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:26,783 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:26,784 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:26,784 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:26,784 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:26,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:26,832 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:27,144 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:27,157 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:27,162 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:27,162 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:27,163 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:27,163 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:27,163 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:27,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:27,164 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:27,164 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:27,165 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-07 00:28:27,165 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-07 00:28:27,165 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:27,166 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:27,166 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:27,166 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:28:27,166 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:27,496 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:27,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 38 [2019-10-07 00:28:27,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 00:28:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 00:28:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 00:28:27,503 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 38 states. [2019-10-07 00:28:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:29,386 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2019-10-07 00:28:29,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:28:29,387 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-10-07 00:28:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:29,388 INFO L225 Difference]: With dead ends: 109 [2019-10-07 00:28:29,389 INFO L226 Difference]: Without dead ends: 91 [2019-10-07 00:28:29,393 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1748, Invalid=4894, Unknown=0, NotChecked=0, Total=6642 [2019-10-07 00:28:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-07 00:28:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-10-07 00:28:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-07 00:28:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-07 00:28:29,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28 [2019-10-07 00:28:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:29,407 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-07 00:28:29,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 00:28:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-07 00:28:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 00:28:29,409 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:29,409 INFO L385 BasicCegarLoop]: trace histogram [25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:29,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:29,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 102164889, now seen corresponding path program 4 times [2019-10-07 00:28:29,614 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:29,615 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:29,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:29,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-07 00:28:29,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:29,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:29,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:29,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 00:28:29,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:28:30,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:28:30,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:30,757 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:30,757 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:30,758 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:30,758 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:30,758 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:30,786 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:31,070 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:31,077 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:31,080 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:31,081 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:31,081 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:31,081 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:31,081 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:31,081 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:31,082 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:31,082 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:31,082 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-07 00:28:31,082 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-07 00:28:31,082 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:31,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:31,083 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:31,083 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:28:31,083 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:31,375 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:31,376 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 28, 11] total 73 [2019-10-07 00:28:31,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-07 00:28:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-07 00:28:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2102, Invalid=3154, Unknown=0, NotChecked=0, Total=5256 [2019-10-07 00:28:31,381 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 73 states. [2019-10-07 00:28:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:35,783 INFO L93 Difference]: Finished difference Result 167 states and 225 transitions. [2019-10-07 00:28:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-07 00:28:35,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 48 [2019-10-07 00:28:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:35,787 INFO L225 Difference]: With dead ends: 167 [2019-10-07 00:28:35,787 INFO L226 Difference]: Without dead ends: 146 [2019-10-07 00:28:35,794 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8797 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7432, Invalid=17060, Unknown=0, NotChecked=0, Total=24492 [2019-10-07 00:28:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-07 00:28:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2019-10-07 00:28:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-07 00:28:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-10-07 00:28:35,818 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 48 [2019-10-07 00:28:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:35,818 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-10-07 00:28:35,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-07 00:28:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-10-07 00:28:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:28:35,821 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:35,821 INFO L385 BasicCegarLoop]: trace histogram [60, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:36,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:36,026 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1214782940, now seen corresponding path program 5 times [2019-10-07 00:28:36,027 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:36,028 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:36,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:36,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-07 00:28:36,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:36,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:36,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:43,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-07 00:28:43,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:43,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-07 00:28:43,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-07 00:28:43,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-07 00:28:44,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:44,024 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:44,024 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:44,025 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:44,025 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:44,025 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:44,052 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:44,290 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:44,300 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:44,304 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:44,304 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:44,304 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:44,305 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:44,305 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:44,305 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:44,305 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:44,306 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:44,306 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-07 00:28:44,306 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-07 00:28:44,306 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:44,306 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:44,307 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:44,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:28:44,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:44,612 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:44,612 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 47 [2019-10-07 00:28:44,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-07 00:28:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-07 00:28:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=1396, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:28:44,615 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 47 states. [2019-10-07 00:28:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:48,502 INFO L93 Difference]: Finished difference Result 225 states and 277 transitions. [2019-10-07 00:28:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-07 00:28:48,503 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-10-07 00:28:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:48,506 INFO L225 Difference]: With dead ends: 225 [2019-10-07 00:28:48,506 INFO L226 Difference]: Without dead ends: 216 [2019-10-07 00:28:48,511 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4206, Invalid=10556, Unknown=0, NotChecked=0, Total=14762 [2019-10-07 00:28:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-07 00:28:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 110. [2019-10-07 00:28:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-07 00:28:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-07 00:28:48,540 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 88 [2019-10-07 00:28:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:48,540 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-07 00:28:48,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-07 00:28:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-07 00:28:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 00:28:48,544 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:48,544 INFO L385 BasicCegarLoop]: trace histogram [60, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:48,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:48,745 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:48,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:48,746 INFO L82 PathProgramCache]: Analyzing trace with hash -665238532, now seen corresponding path program 6 times [2019-10-07 00:28:48,746 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:48,746 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:48,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:48,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:48,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-07 00:28:49,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:49,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:49,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:49,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:28:49,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:49,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-07 00:28:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:28:50,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:28:53,053 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:53,054 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:53,054 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:53,055 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:53,055 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:53,055 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:53,074 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:53,316 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:53,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:53,325 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:53,325 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:53,325 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (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-07 00:28:53,325 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:53,325 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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-07 00:28:53,326 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:53,326 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:53,326 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:53,326 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-07 00:28:53,327 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-07 00:28:53,327 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:53,327 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:53,327 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:53,327 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-07 00:28:53,328 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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-07 00:28:53,706 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:53,707 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 63, 63, 11] total 161 [2019-10-07 00:28:53,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-10-07 00:28:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-10-07 00:28:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11650, Invalid=14110, Unknown=0, NotChecked=0, Total=25760 [2019-10-07 00:28:53,713 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 161 states. [2019-10-07 00:29:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:12,269 INFO L93 Difference]: Finished difference Result 390 states and 534 transitions. [2019-10-07 00:29:12,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-10-07 00:29:12,269 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 106 [2019-10-07 00:29:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:12,272 INFO L225 Difference]: With dead ends: 390 [2019-10-07 00:29:12,272 INFO L226 Difference]: Without dead ends: 346 [2019-10-07 00:29:12,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46144 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=42560, Invalid=87400, Unknown=0, NotChecked=0, Total=129960 [2019-10-07 00:29:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-07 00:29:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2019-10-07 00:29:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-07 00:29:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2019-10-07 00:29:12,315 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 106 [2019-10-07 00:29:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:12,316 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2019-10-07 00:29:12,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-10-07 00:29:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2019-10-07 00:29:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-07 00:29:12,322 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:12,322 INFO L385 BasicCegarLoop]: trace histogram [148, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:12,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:12,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:12,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1203855460, now seen corresponding path program 7 times [2019-10-07 00:29:12,525 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:12,525 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:12,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:12,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12016 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 11026 trivial. 0 not checked. [2019-10-07 00:29:13,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:13,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:13,984 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:14,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 150 conjunts are in the unsatisfiable core [2019-10-07 00:29:14,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12016 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-10-07 00:29:15,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12016 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-10-07 00:29:28,843 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:28,844 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:28,844 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:28,845 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:28,845 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:28,845 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:28,869 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:29,098 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:29,105 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:29,107 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:29,107 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:29,107 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:29,107 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:29,108 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:29,108 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:29,108 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:29,109 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 28 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:29,109 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-07 00:29:29,109 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-07 00:29:29,109 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:29,110 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:29,110 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:29,110 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) [2019-10-07 00:29:29,110 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:29,548 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:29,549 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 151, 151, 11] total 334 [2019-10-07 00:29:29,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 334 states [2019-10-07 00:29:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 334 interpolants. [2019-10-07 00:29:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52997, Invalid=58225, Unknown=0, NotChecked=0, Total=111222 [2019-10-07 00:29:29,566 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 334 states. [2019-10-07 00:30:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:37,215 INFO L93 Difference]: Finished difference Result 665 states and 930 transitions. [2019-10-07 00:30:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2019-10-07 00:30:37,215 INFO L78 Accepts]: Start accepts. Automaton has 334 states. Word has length 204 [2019-10-07 00:30:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:37,219 INFO L225 Difference]: With dead ends: 665 [2019-10-07 00:30:37,220 INFO L226 Difference]: Without dead ends: 611 [2019-10-07 00:30:37,234 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200311 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=182668, Invalid=349502, Unknown=0, NotChecked=0, Total=532170 [2019-10-07 00:30:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-07 00:30:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 404. [2019-10-07 00:30:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-07 00:30:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 406 transitions. [2019-10-07 00:30:37,280 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 406 transitions. Word has length 204 [2019-10-07 00:30:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:37,280 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 406 transitions. [2019-10-07 00:30:37,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 334 states. [2019-10-07 00:30:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 406 transitions. [2019-10-07 00:30:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-07 00:30:37,288 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:37,288 INFO L385 BasicCegarLoop]: trace histogram [321, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:37,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:37,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash 9767961, now seen corresponding path program 8 times [2019-10-07 00:30:37,494 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:37,494 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:37,495 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:37,495 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 53959 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 51681 trivial. 0 not checked. [2019-10-07 00:30:40,733 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:40,733 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:40,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true