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/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:57:46,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:46,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:46,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:46,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:47,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:47,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:47,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:47,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:47,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:47,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:47,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:47,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:47,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:47,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:47,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:47,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:47,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:47,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:47,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:47,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:47,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:47,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:47,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:47,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:47,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:47,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:47,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:47,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:47,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:47,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:47,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:47,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:47,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:47,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:47,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:47,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:47,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:47,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:47,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:47,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:47,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:57:47,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:47,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:47,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:47,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:47,067 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:47,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:47,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:47,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:47,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:47,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:47,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:47,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:47,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:47,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:47,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:47,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:47,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:47,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:47,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:47,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:47,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:47,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:47,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:47,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:47,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:47,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:47,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:47,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:47,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:57:47,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:47,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:47,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:47,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:47,385 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:47,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-13 22:57:47,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0309ba4/e25a8986ecf741d5ae20117bce8b3bd2/FLAG6e1943b9a [2019-10-13 22:57:47,935 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:47,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-13 22:57:47,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0309ba4/e25a8986ecf741d5ae20117bce8b3bd2/FLAG6e1943b9a [2019-10-13 22:57:48,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0309ba4/e25a8986ecf741d5ae20117bce8b3bd2 [2019-10-13 22:57:48,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:48,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:48,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:48,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:48,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:48,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c55454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48, skipping insertion in model container [2019-10-13 22:57:48,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:48,387 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:48,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:48,581 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:48,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:48,616 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:48,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48 WrapperNode [2019-10-13 22:57:48,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:48,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:48,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:48,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:48,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... [2019-10-13 22:57:48,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:48,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:48,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:48,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:48,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:48,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:48,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:48,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:57:48,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:57:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:57:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:57:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:49,027 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:49,028 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:57:49,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:49 BoogieIcfgContainer [2019-10-13 22:57:49,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:49,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:49,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:49,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:49,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:48" (1/3) ... [2019-10-13 22:57:49,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d47a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:49, skipping insertion in model container [2019-10-13 22:57:49,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:48" (2/3) ... [2019-10-13 22:57:49,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d47a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:49, skipping insertion in model container [2019-10-13 22:57:49,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:49" (3/3) ... [2019-10-13 22:57:49,040 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2019-10-13 22:57:49,050 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:49,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:57:49,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:57:49,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:49,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:49,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:49,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:49,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:49,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:49,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:49,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-13 22:57:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:57:49,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:49,126 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:49,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2145607436, now seen corresponding path program 1 times [2019-10-13 22:57:49,147 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:49,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979162331] [2019-10-13 22:57:49,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:49,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:49,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:49,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979162331] [2019-10-13 22:57:49,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:49,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:49,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605412522] [2019-10-13 22:57:49,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:49,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:49,349 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-13 22:57:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:49,414 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-13 22:57:49,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:49,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-13 22:57:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:49,429 INFO L225 Difference]: With dead ends: 34 [2019-10-13 22:57:49,429 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 22:57:49,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 22:57:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-13 22:57:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:57:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:57:49,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-13 22:57:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:49,482 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:57:49,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:57:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:49,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:49,484 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:49,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1122509676, now seen corresponding path program 1 times [2019-10-13 22:57:49,486 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:49,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681425901] [2019-10-13 22:57:49,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:49,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:49,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:49,632 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-13 22:57:49,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681425901] [2019-10-13 22:57:49,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497438052] [2019-10-13 22:57:49,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:49,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 22:57:49,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:49,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 22:57:49,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:57:49,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:57:49,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:57:49,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-10-13 22:57:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:49,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 22:57:49,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 22:57:49,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-10-13 22:57:49,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:57:49,845 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:49,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 22:57:49,862 INFO L567 ElimStorePlain]: treesize reduction 10, result has 47.4 percent of original size [2019-10-13 22:57:49,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:57:49,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2019-10-13 22:57:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:49,913 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-13 22:57:49,914 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:49,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2019-10-13 22:57:50,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-10-13 22:57:50,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 22:57:50,103 INFO L567 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-10-13 22:57:50,103 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:57:50,133 INFO L567 ElimStorePlain]: treesize reduction 46, result has 34.3 percent of original size [2019-10-13 22:57:50,134 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-13 22:57:50,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 22:57:50,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:79, output treesize:24 [2019-10-13 22:57:51,077 WARN L191 SmtUtils]: Spent 909.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-13 22:57:51,098 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-13 22:57:51,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [448467735] [2019-10-13 22:57:51,134 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:51,134 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:51,140 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:51,149 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:51,149 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:51,306 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:51,505 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:51,550 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 24 for LOIs [2019-10-13 22:57:51,576 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:51,586 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:51,587 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:51,587 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:51,587 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:51,587 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 73#(and (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) [2019-10-13 22:57:51,597 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:51,597 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:51,597 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:51,597 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:51,598 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:51,598 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 88#(and (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:51,599 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) [2019-10-13 22:57:51,601 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 78#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#array~0.base|) (+ (* (ite (<= (mod main_~index~0 4294967296) 2147483647) (mod main_~index~0 4294967296) (+ (mod main_~index~0 4294967296) (- 4294967296))) 4) |main_~#array~0.offset|))) (< (mod main_~index~0 4294967296) 10000) (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) [2019-10-13 22:57:51,601 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 68#true [2019-10-13 22:57:52,013 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:52,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8, 10] total 22 [2019-10-13 22:57:52,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781613641] [2019-10-13 22:57:52,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 22:57:52,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 22:57:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-10-13 22:57:52,023 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 22 states. [2019-10-13 22:57:52,609 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-13 22:57:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:52,799 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-13 22:57:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 22:57:52,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2019-10-13 22:57:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:52,801 INFO L225 Difference]: With dead ends: 36 [2019-10-13 22:57:52,802 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 22:57:52,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-10-13 22:57:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 22:57:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-10-13 22:57:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 22:57:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-13 22:57:52,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2019-10-13 22:57:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:52,818 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-13 22:57:52,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 22:57:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-13 22:57:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:57:52,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:52,820 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:53,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:53,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2118559936, now seen corresponding path program 1 times [2019-10-13 22:57:53,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:53,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981943843] [2019-10-13 22:57:53,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:57:53,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981943843] [2019-10-13 22:57:53,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480054555] [2019-10-13 22:57:53,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 22:57:53,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:53,261 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:53,438 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:53,526 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:53,704 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-13 22:57:54,118 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-10-13 22:57:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:54,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145251189] [2019-10-13 22:57:54,197 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 22:57:54,197 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:54,197 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:54,198 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:54,198 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:54,255 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:54,426 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:54,435 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:54,518 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:54,729 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-13 22:57:54,782 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:54,788 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:54,788 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:54,789 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 176#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,789 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 185#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:54,789 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 161#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (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) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:57:54,790 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 171#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,790 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,790 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,790 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 151#(or (exists ((|v_main_#t~mem4_13| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_13| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-13 22:57:54,791 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 181#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,791 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 190#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,791 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:54,791 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#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) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:57:54,792 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 142#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:54,792 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 166#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:54,792 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 130#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:54,792 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 74#(and (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_~#array~0.offset|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:57,720 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:57,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10, 11] total 31 [2019-10-13 22:57:57,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701597022] [2019-10-13 22:57:57,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 22:57:57,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 22:57:57,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=827, Unknown=1, NotChecked=0, Total=930 [2019-10-13 22:57:57,724 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 31 states. [2019-10-13 22:58:02,224 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-13 22:58:03,037 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-13 22:58:04,326 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-13 22:58:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:04,332 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-10-13 22:58:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 22:58:04,333 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 20 [2019-10-13 22:58:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:04,335 INFO L225 Difference]: With dead ends: 48 [2019-10-13 22:58:04,335 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 22:58:04,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=305, Invalid=1856, Unknown=1, NotChecked=0, Total=2162 [2019-10-13 22:58:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 22:58:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-10-13 22:58:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 22:58:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-13 22:58:04,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2019-10-13 22:58:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:04,347 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-13 22:58:04,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 22:58:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-13 22:58:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 22:58:04,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:04,349 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:04,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:04,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 322407660, now seen corresponding path program 2 times [2019-10-13 22:58:04,552 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:04,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5964359] [2019-10-13 22:58:04,552 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:04,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:04,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 22:58:04,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5964359] [2019-10-13 22:58:04,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461069273] [2019-10-13 22:58:04,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:10,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 22:58:10,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:58:10,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 22:58:10,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 22:58:10,634 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:12,356 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-10-13 22:58:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 22:58:12,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106880242] [2019-10-13 22:58:12,363 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 22:58:12,363 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:58:12,364 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:58:12,364 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:58:12,364 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:58:12,385 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:58:12,436 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:12,583 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-13 22:58:12,636 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:58:12,654 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:58:12,655 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:58:12,655 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 161#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,655 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 170#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:58:12,655 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 146#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (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) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:58:12,655 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 156#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,656 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,656 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,656 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 136#(or (exists ((|v_main_#t~mem4_21| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_21| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-13 22:58:12,656 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 166#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,657 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 175#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,657 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:58:12,657 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 141#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#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) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:58:12,657 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 127#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:58:12,658 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 151#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:12,658 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 115#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:58:12,658 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:58:13,505 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:58:13,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 13, 11] total 32 [2019-10-13 22:58:13,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351720766] [2019-10-13 22:58:13,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 22:58:13,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:13,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 22:58:13,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-10-13 22:58:13,508 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 32 states. [2019-10-13 22:58:19,125 WARN L191 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-13 22:58:19,593 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-13 22:58:26,496 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-13 22:58:26,982 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-13 22:58:27,265 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-13 22:58:27,682 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-13 22:58:28,201 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-13 22:58:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:28,325 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2019-10-13 22:58:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 22:58:28,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2019-10-13 22:58:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:28,327 INFO L225 Difference]: With dead ends: 85 [2019-10-13 22:58:28,327 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 22:58:28,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=730, Invalid=3560, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:58:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 22:58:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-13 22:58:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 22:58:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 22:58:28,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 28 [2019-10-13 22:58:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:28,350 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 22:58:28,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 22:58:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 22:58:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 22:58:28,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:28,352 INFO L380 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:28,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:28,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash 57683084, now seen corresponding path program 3 times [2019-10-13 22:58:28,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:28,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826841280] [2019-10-13 22:58:28,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:28,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:28,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 22:58:28,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826841280] [2019-10-13 22:58:28,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142251976] [2019-10-13 22:58:28,737 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:28,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:58:28,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:58:28,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-13 22:58:28,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:28,842 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:28,900 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,031 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,229 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,376 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,513 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,870 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 22:58:29,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:30,556 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-13 22:58:31,732 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 14 [2019-10-13 22:58:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 22:58:31,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806710666] [2019-10-13 22:58:31,867 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 22:58:31,867 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:58:31,868 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:58:31,868 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:58:31,868 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:58:31,910 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:58:31,967 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:32,039 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:58:32,059 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:58:32,062 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:58:32,063 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:58:32,063 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 170#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:58:32,063 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 179#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:58:32,063 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 155#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:58:32,064 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 165#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:58:32,064 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:32,064 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:32,064 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 145#(or (and (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) (exists ((|v_main_#t~mem4_29| Int)) (and (<= 1 main_~index~0) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_29| 4294967296))))) [2019-10-13 22:58:32,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:58:32,065 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:58:32,065 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:58:32,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 150#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:58:32,065 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 136#(and (<= 0 main_~index~0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))) [2019-10-13 22:58:32,066 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 160#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:58:32,066 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 124#(<= 0 main_~index~0) [2019-10-13 22:58:32,066 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 68#true [2019-10-13 22:58:32,645 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:58:32,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12, 12] total 40 [2019-10-13 22:58:32,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777971737] [2019-10-13 22:58:32,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 22:58:32,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 22:58:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 22:58:32,650 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 40 states.