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_seq_init_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:24:01,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:24:01,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:24:01,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:24:01,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:24:01,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:24:01,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:24:01,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:24:01,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:24:01,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:24:01,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:24:01,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:24:01,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:24:01,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:24:01,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:24:01,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:24:01,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:24:01,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:24:01,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:24:01,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:24:01,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:24:01,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:24:01,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:24:01,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:24:01,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:24:01,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:24:01,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:24:01,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:24:01,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:24:01,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:24:01,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:24:01,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:24:01,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:24:01,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:24:01,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:24:01,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:24:01,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:24:01,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:24:01,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:24:01,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:24:01,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:24:01,577 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:24:01,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:24:01,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:24:01,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:24:01,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:24:01,599 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:24:01,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:24:01,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:24:01,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:24:01,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:24:01,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:24:01,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:24:01,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:24:01,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:24:01,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:24:01,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:24:01,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:24:01,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:24:01,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:24:01,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:24:01,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:24:01,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:24:01,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:01,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:24:01,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:24:01,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:24:01,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:24:01,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:24:01,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:24:01,604 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:24:01,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:24:01,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:24:01,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:24:01,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:24:01,915 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:24:01,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_seq_init_ground.i [2019-10-07 00:24:02,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df3a7504/69bde096f6514a1d85b0cee08d9382b9/FLAG573bf6eb8 [2019-10-07 00:24:02,464 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:24:02,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_seq_init_ground.i [2019-10-07 00:24:02,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df3a7504/69bde096f6514a1d85b0cee08d9382b9/FLAG573bf6eb8 [2019-10-07 00:24:02,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df3a7504/69bde096f6514a1d85b0cee08d9382b9 [2019-10-07 00:24:02,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:24:02,836 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:24:02,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:02,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:24:02,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:24:02,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:02" (1/1) ... [2019-10-07 00:24:02,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46892c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:02, skipping insertion in model container [2019-10-07 00:24:02,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:02" (1/1) ... [2019-10-07 00:24:02,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:24:02,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:24:03,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:03,157 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:24:03,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:03,218 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:24:03,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03 WrapperNode [2019-10-07 00:24:03,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:03,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:24:03,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:24:03,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:24:03,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (1/1) ... [2019-10-07 00:24:03,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:24:03,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:24:03,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:24:03,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:24:03,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (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:24:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:24:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:24:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:24:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:24:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:24:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:24:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:24:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:24:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:24:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:24:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:24:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:24:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:24:03,718 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:24:03,719 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:24:03,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:03 BoogieIcfgContainer [2019-10-07 00:24:03,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:24:03,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:24:03,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:24:03,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:24:03,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:24:02" (1/3) ... [2019-10-07 00:24:03,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d28ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:03, skipping insertion in model container [2019-10-07 00:24:03,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:03" (2/3) ... [2019-10-07 00:24:03,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d28ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:03, skipping insertion in model container [2019-10-07 00:24:03,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:03" (3/3) ... [2019-10-07 00:24:03,733 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_seq_init_ground.i [2019-10-07 00:24:03,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:24:03,773 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:24:03,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:24:03,839 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:24:03,839 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:24:03,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:24:03,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:24:03,840 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:24:03,840 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:24:03,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:24:03,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:24:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 00:24:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 00:24:03,861 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:03,862 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:03,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -10208272, now seen corresponding path program 1 times [2019-10-07 00:24:03,877 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:03,877 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:03,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:03,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:04,052 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:24:04,053 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:04,054 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:04,054 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:04,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:04,070 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-07 00:24:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:04,108 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-07 00:24:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:04,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 00:24:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:04,117 INFO L225 Difference]: With dead ends: 31 [2019-10-07 00:24:04,117 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 00:24:04,121 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:24:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 00:24:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 00:24:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 00:24:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 00:24:04,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-07 00:24:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:04,164 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 00:24:04,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 00:24:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:24:04,166 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:04,166 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:04,167 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1040450566, now seen corresponding path program 1 times [2019-10-07 00:24:04,170 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:04,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:04,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:04,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:04,243 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:04,244 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:04,244 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:24:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:04,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:04,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:04,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:04,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:04,416 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:24:04,416 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:04,425 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:04,434 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:04,435 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:04,620 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:05,025 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:24:05,057 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:05,070 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:05,071 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:05,071 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:05,072 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:24:05,072 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:24:05,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:24:05,074 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= 1 main_~i~0) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:05,075 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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:24:05,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:05,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:05,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:24:05,078 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:05,079 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:05,080 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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:24:05,606 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:05,606 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 16 [2019-10-07 00:24:05,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 00:24:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 00:24:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-10-07 00:24:05,610 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 16 states. [2019-10-07 00:24:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:06,380 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-07 00:24:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:24:06,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2019-10-07 00:24:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:06,382 INFO L225 Difference]: With dead ends: 37 [2019-10-07 00:24:06,383 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 00:24:06,385 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-10-07 00:24:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 00:24:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-10-07 00:24:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:24:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-07 00:24:06,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2019-10-07 00:24:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:06,394 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-07 00:24:06,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 00:24:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-07 00:24:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:24:06,397 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:06,397 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:06,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:06,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1927245456, now seen corresponding path program 2 times [2019-10-07 00:24:06,602 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:06,603 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:06,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:06,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:06,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:06,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:06,684 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:24:06,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:24:06,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:06,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:24:06,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:06,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:06,833 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:06,835 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:24:06,835 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:06,836 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:06,836 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:06,836 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:06,871 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:07,072 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:24:07,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:07,094 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:07,094 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:07,095 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_2) 0) (select (select |#memory_int| v_prenex_2) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:07,095 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:24:07,095 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:24:07,096 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:24:07,096 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= 1 main_~i~0) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:07,096 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_2) 0) (select (select |#memory_int| v_prenex_2) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:07,096 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:07,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:07,097 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_2) 0) (select (select |#memory_int| v_prenex_2) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:24:07,097 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:07,097 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:07,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_2) 0) (select (select |#memory_int| v_prenex_2) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:07,544 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:07,544 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 22 [2019-10-07 00:24:07,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 00:24:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 00:24:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-07 00:24:07,546 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 22 states. [2019-10-07 00:24:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:08,516 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-10-07 00:24:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:24:08,516 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 15 [2019-10-07 00:24:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:08,518 INFO L225 Difference]: With dead ends: 43 [2019-10-07 00:24:08,518 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 00:24:08,519 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:24:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 00:24:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-07 00:24:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:24:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 00:24:08,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-10-07 00:24:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:08,527 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 00:24:08,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 00:24:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 00:24:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:24:08,528 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:08,528 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:08,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:08,740 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 417360304, now seen corresponding path program 3 times [2019-10-07 00:24:08,740 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:08,741 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:08,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:08,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:08,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:08,943 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:08,943 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:24:09,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:24:09,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:09,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:24:09,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:09,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:09,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:09,274 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:24:09,275 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:09,276 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:09,276 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:09,276 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:09,311 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:09,488 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:24:09,520 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:09,528 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:09,529 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:09,529 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4)))) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_3) 0) (select (select |#memory_int| v_prenex_3) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:09,529 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:24:09,530 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:24:09,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:24:09,531 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= 1 main_~i~0) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:09,536 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4)))) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_3) 0) (select (select |#memory_int| v_prenex_3) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:09,537 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:09,537 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:09,537 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4)))) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_3) 0) (select (select |#memory_int| v_prenex_3) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:24:09,538 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:09,539 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:09,540 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4)))) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_3) 0) (select (select |#memory_int| v_prenex_3) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:10,100 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:10,100 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 10] total 34 [2019-10-07 00:24:10,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 00:24:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 00:24:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:24:10,103 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 34 states. [2019-10-07 00:24:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:11,629 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-10-07 00:24:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-07 00:24:11,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 21 [2019-10-07 00:24:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:11,631 INFO L225 Difference]: With dead ends: 55 [2019-10-07 00:24:11,631 INFO L226 Difference]: Without dead ends: 46 [2019-10-07 00:24:11,633 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=953, Invalid=2953, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 00:24:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-07 00:24:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-07 00:24:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 00:24:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-07 00:24:11,643 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-10-07 00:24:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:11,643 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-07 00:24:11,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 00:24:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-07 00:24:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 00:24:11,645 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:11,645 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:11,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:11,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash 678070832, now seen corresponding path program 4 times [2019-10-07 00:24:11,850 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:11,850 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:11,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:11,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:12,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:12,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:12,192 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:24:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:12,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:24:12,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:12,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:13,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:13,028 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:24:13,028 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:13,029 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:13,029 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:13,029 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:13,061 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:13,187 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:24:13,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:13,200 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:13,200 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:13,200 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| v_prenex_4) 0) (select (select |#memory_int| v_prenex_4) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:13,201 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:24:13,201 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:24:13,201 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:24:13,201 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:13,202 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| v_prenex_4) 0) (select (select |#memory_int| v_prenex_4) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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:24:13,202 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:13,202 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:13,202 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| v_prenex_4) 0) (select (select |#memory_int| v_prenex_4) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:24:13,203 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:13,203 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:13,203 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| v_prenex_4) 0) (select (select |#memory_int| v_prenex_4) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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:24:13,724 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:13,724 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 10] total 58 [2019-10-07 00:24:13,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 00:24:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 00:24:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=2149, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 00:24:13,729 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 58 states. [2019-10-07 00:24:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:17,230 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2019-10-07 00:24:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-07 00:24:17,230 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 33 [2019-10-07 00:24:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:17,232 INFO L225 Difference]: With dead ends: 79 [2019-10-07 00:24:17,232 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 00:24:17,238 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2594 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3557, Invalid=8653, Unknown=0, NotChecked=0, Total=12210 [2019-10-07 00:24:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 00:24:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-07 00:24:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-07 00:24:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-10-07 00:24:17,251 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 33 [2019-10-07 00:24:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:17,252 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-10-07 00:24:17,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 00:24:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-10-07 00:24:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 00:24:17,254 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:17,254 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:17,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:17,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1902605520, now seen corresponding path program 5 times [2019-10-07 00:24:17,460 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:17,460 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:17,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:17,461 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:18,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:18,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:18,587 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:24:37,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:24:37,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:37,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:24:37,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:37,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:40,026 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:40,028 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:24:40,028 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:40,028 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:40,028 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:40,029 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:40,052 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:40,194 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:24:40,205 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:40,209 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:40,210 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:40,210 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) 0) (select (select |#memory_int| v_prenex_5) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:24:40,211 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:24:40,215 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:24:40,215 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:24:40,215 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:40,216 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) 0) (select (select |#memory_int| v_prenex_5) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:24:40,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:40,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:40,216 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) 0) (select (select |#memory_int| v_prenex_5) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:24:40,217 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:40,217 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:24:40,217 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) 0) (select (select |#memory_int| v_prenex_5) 4))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:24:40,910 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:40,911 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 10] total 106 [2019-10-07 00:24:40,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-10-07 00:24:40,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-10-07 00:24:40,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4589, Invalid=6541, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 00:24:40,917 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 106 states. [2019-10-07 00:24:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:49,742 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2019-10-07 00:24:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-07 00:24:49,742 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 57 [2019-10-07 00:24:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:49,745 INFO L225 Difference]: With dead ends: 127 [2019-10-07 00:24:49,745 INFO L226 Difference]: Without dead ends: 118 [2019-10-07 00:24:49,753 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8102 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=13949, Invalid=28693, Unknown=0, NotChecked=0, Total=42642 [2019-10-07 00:24:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-07 00:24:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-10-07 00:24:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-07 00:24:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-10-07 00:24:49,771 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 57 [2019-10-07 00:24:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:49,772 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-10-07 00:24:49,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-10-07 00:24:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-10-07 00:24:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 00:24:49,776 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:49,776 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:49,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:49,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1763996368, now seen corresponding path program 6 times [2019-10-07 00:24:49,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:49,979 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:49,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:49,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:53,507 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:53,507 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:53,507 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:24:53,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:24:53,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:53,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:24:53,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:53,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:25:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:25:03,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:25:03,618 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:25:03,618 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:25:03,619 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:25:03,619 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:25:03,619 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:25:03,638 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:25:03,727 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:25:03,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:25:03,740 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:25:03,741 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:25:03,741 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:25:03,741 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:25:03,741 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_6) 0) (select (select |#memory_int| v_prenex_6) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:25:03,742 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= 1 main_~i~0) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:25:03,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:25:03,744 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_6) 0) (select (select |#memory_int| v_prenex_6) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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:25:03,744 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:25:03,744 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:25:03,744 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_6) 0) (select (select |#memory_int| v_prenex_6) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:25:03,745 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:25:03,745 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:25:03,745 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= (select (select |#memory_int| v_prenex_6) 0) (select (select |#memory_int| v_prenex_6) 4)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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:25:04,734 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:25:04,735 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 10] total 202 [2019-10-07 00:25:04,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-10-07 00:25:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-10-07 00:25:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18365, Invalid=22237, Unknown=0, NotChecked=0, Total=40602 [2019-10-07 00:25:04,745 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 202 states. [2019-10-07 00:25:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:25:31,714 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2019-10-07 00:25:31,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2019-10-07 00:25:31,715 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 105 [2019-10-07 00:25:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:25:31,718 INFO L225 Difference]: With dead ends: 223 [2019-10-07 00:25:31,719 INFO L226 Difference]: Without dead ends: 214 [2019-10-07 00:25:31,736 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27758 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=55469, Invalid=103333, Unknown=0, NotChecked=0, Total=158802 [2019-10-07 00:25:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-07 00:25:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2019-10-07 00:25:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-07 00:25:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-10-07 00:25:31,769 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 105 [2019-10-07 00:25:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:25:31,769 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-10-07 00:25:31,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-10-07 00:25:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-10-07 00:25:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 00:25:31,773 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:25:31,773 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:25:31,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:25:31,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:25:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:25:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash 318607664, now seen corresponding path program 7 times [2019-10-07 00:25:31,976 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:25:31,976 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:25:31,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:25:31,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:25:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:25:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:25:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:25:45,271 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:25:45,271 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:25:45,272 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:25:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:25:45,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 00:25:45,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:25:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:25:45,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:26:25,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:25,361 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:26:25,362 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:25,362 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:25,362 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:25,362 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:25,392 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:25,482 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 00:26:25,490 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:25,495 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:25,496 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:25,496 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:26:25,496 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:26:25,500 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_7) 0) (select (select |#memory_int| v_prenex_7) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 4))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:26:25,500 INFO L193 IcfgInterpreter]: Reachable states at location L8-2 satisfy 71#(and (or (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| |main_~#a~0.base| (store (select |old(#memory_int)| |main_~#a~0.base|) |main_~#a~0.offset| 7)) |#memory_int|) (= main_~i~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (<= 1 main_~i~0) (<= main_~i~0 1) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= 1 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:26:25,500 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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:26:25,501 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:25,501 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_7) 0) (select (select |#memory_int| v_prenex_7) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 4))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:26:25,501 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:25,501 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_7) 0) (select (select |#memory_int| v_prenex_7) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 4))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:26:25,501 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 81#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< main_~x~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem2|) (= |main_#t~mem3| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| (- 4)))) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:26:25,502 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 76#(and (= |#NULL.base| 0) (= main_~x~0 1) (<= |#NULL.base| 0) (<= main_~x~0 1) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 100000 main_~i~0) (<= 1 main_~x~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:26:25,502 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= (select (select |#memory_int| v_prenex_7) 0) (select (select |#memory_int| v_prenex_7) 4)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 4))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:26:27,136 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:27,137 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 10] total 394 [2019-10-07 00:26:27,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 394 states [2019-10-07 00:26:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 394 interpolants. [2019-10-07 00:26:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73565, Invalid=81277, Unknown=0, NotChecked=0, Total=154842 [2019-10-07 00:26:27,155 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 394 states. [2019-10-07 00:28:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:04,834 INFO L93 Difference]: Finished difference Result 415 states and 608 transitions. [2019-10-07 00:28:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 394 states. [2019-10-07 00:28:04,835 INFO L78 Accepts]: Start accepts. Automaton has 394 states. Word has length 201 [2019-10-07 00:28:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:04,838 INFO L225 Difference]: With dead ends: 415 [2019-10-07 00:28:04,838 INFO L226 Difference]: Without dead ends: 406 [2019-10-07 00:28:04,852 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 781 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101630 ImplicationChecksByTransitivity, 146.6s TimeCoverageRelationStatistics Valid=221453, Invalid=390853, Unknown=0, NotChecked=0, Total=612306 [2019-10-07 00:28:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-07 00:28:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2019-10-07 00:28:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-07 00:28:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2019-10-07 00:28:04,896 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 201 [2019-10-07 00:28:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:04,896 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2019-10-07 00:28:04,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 394 states. [2019-10-07 00:28:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2019-10-07 00:28:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-07 00:28:04,921 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:04,921 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:05,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:05,130 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1716414160, now seen corresponding path program 8 times [2019-10-07 00:28:05,130 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:05,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:05,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:05,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:28:57,833 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:57,834 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:57,834 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