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_3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:33:43,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:33:43,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:33:43,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:33:43,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:33:43,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:33:43,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:33:43,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:33:43,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:33:43,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:33:43,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:33:43,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:33:43,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:33:43,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:33:43,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:33:43,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:33:43,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:33:43,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:33:43,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:33:43,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:33:43,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:33:43,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:33:43,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:33:43,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:33:43,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:33:43,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:33:43,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:33:43,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:33:43,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:33:43,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:33:43,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:33:43,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:33:43,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:33:43,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:33:43,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:33:43,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:33:43,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:33:43,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:33:43,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:33:43,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:33:43,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:33:43,783 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 13:33:43,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:33:43,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:33:43,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:33:43,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:33:43,799 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:33:43,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:33:43,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:33:43,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:33:43,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:33:43,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:33:43,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:33:43,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:33:43,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:33:43,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:33:43,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:33:43,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:33:43,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:33:43,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:33:43,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:33:43,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:33:43,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:33:43,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:33:43,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:33:43,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:33:43,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:33:43,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:33:43,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:33:43,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:33:43,804 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 13:33:44,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:33:44,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:33:44,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:33:44,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:33:44,175 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:33:44,176 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_3.i [2019-10-07 13:33:44,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebfa2bba/3185a4e9a7b445ea8e27e6451a5706cb/FLAGc44690f7d [2019-10-07 13:33:44,652 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:33:44,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2019-10-07 13:33:44,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebfa2bba/3185a4e9a7b445ea8e27e6451a5706cb/FLAGc44690f7d [2019-10-07 13:33:45,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebfa2bba/3185a4e9a7b445ea8e27e6451a5706cb [2019-10-07 13:33:45,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:33:45,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:33:45,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:33:45,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:33:45,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:33:45,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9690e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45, skipping insertion in model container [2019-10-07 13:33:45,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:33:45,137 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:33:45,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:33:45,384 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:33:45,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:33:45,528 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:33:45,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45 WrapperNode [2019-10-07 13:33:45,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:33:45,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:33:45,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:33:45,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:33:45,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (1/1) ... [2019-10-07 13:33:45,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:33:45,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:33:45,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:33:45,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:33:45,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (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 13:33:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:33:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:33:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:33:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:33:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:33:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:33:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:33:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:33:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:33:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:33:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:33:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:33:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:33:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:33:48,043 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:33:48,043 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:33:48,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:48 BoogieIcfgContainer [2019-10-07 13:33:48,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:33:48,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:33:48,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:33:48,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:33:48,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:33:45" (1/3) ... [2019-10-07 13:33:48,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c1f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:48, skipping insertion in model container [2019-10-07 13:33:48,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:45" (2/3) ... [2019-10-07 13:33:48,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c1f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:48, skipping insertion in model container [2019-10-07 13:33:48,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:48" (3/3) ... [2019-10-07 13:33:48,053 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2019-10-07 13:33:48,061 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:33:48,068 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:33:48,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:33:48,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:33:48,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:33:48,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:33:48,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:33:48,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:33:48,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:33:48,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:33:48,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:33:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 13:33:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:33:48,125 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:48,126 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:48,127 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 793121937, now seen corresponding path program 1 times [2019-10-07 13:33:48,140 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:48,140 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:48,141 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:48,141 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:48,346 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 13:33:48,347 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:48,347 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:33:48,348 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:33:48,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:33:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:33:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:33:48,365 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-07 13:33:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:48,454 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-07 13:33:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:33:48,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 13:33:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:48,468 INFO L225 Difference]: With dead ends: 34 [2019-10-07 13:33:48,469 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 13:33:48,473 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 13:33:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 13:33:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-07 13:33:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 13:33:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 13:33:48,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-07 13:33:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:48,531 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 13:33:48,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:33:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 13:33:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:33:48,534 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:48,534 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:48,534 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash 751349671, now seen corresponding path program 1 times [2019-10-07 13:33:48,537 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:48,537 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:48,537 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:48,538 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:48,743 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 13:33:48,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:48,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:48,744 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 13:33:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:48,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-07 13:33:48,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:48,909 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-07 13:33:48,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:33:48,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:33:48,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:33:48,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-07 13:33:48,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,025 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 13:33:49,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:49,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,423 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-10-07 13:33:49,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:49,488 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 31 treesize of output 29 [2019-10-07 13:33:49,504 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-07 13:33:49,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-07 13:33:49,536 INFO L567 ElimStorePlain]: treesize reduction 6, result has 78.6 percent of original size [2019-10-07 13:33:49,537 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:33:49,574 INFO L567 ElimStorePlain]: treesize reduction 38, result has 36.7 percent of original size [2019-10-07 13:33:49,574 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-07 13:33:49,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 13:33:49,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:63, output treesize:22 [2019-10-07 13:33:49,635 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 13:33:49,636 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:49,673 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:33:49,673 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:49,701 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:49,713 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:49,717 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:49,851 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:50,069 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:50,186 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 13:33:50,203 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:50,214 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:50,214 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:50,215 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 13:33:50,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 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:50,216 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-07 13:33:50,216 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 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|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 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) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:50,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 13:33:50,217 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:50,225 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 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 13:33:50,226 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:50,226 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:50,226 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:50,227 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:50,227 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 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 13:33:50,731 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:50,731 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8, 9] total 23 [2019-10-07 13:33:50,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 13:33:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 13:33:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:33:50,736 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 23 states. [2019-10-07 13:33:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:51,748 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-07 13:33:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 13:33:51,749 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2019-10-07 13:33:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:51,750 INFO L225 Difference]: With dead ends: 38 [2019-10-07 13:33:51,750 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:33:51,752 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:33:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:33:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2019-10-07 13:33:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 13:33:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-07 13:33:51,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-07 13:33:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:51,759 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-07 13:33:51,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 13:33:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-07 13:33:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:33:51,760 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:51,760 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:51,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:51,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash -543590575, now seen corresponding path program 2 times [2019-10-07 13:33:51,969 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:51,969 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:51,969 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:51,969 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:52,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:52,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:52,087 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 13:33:52,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 13:33:52,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:33:52,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:33:52,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:52,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:52,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:52,189 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:33:52,190 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:52,190 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:52,190 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:52,191 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:52,227 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:52,378 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:52,476 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 13:33:52,497 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:52,503 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:52,503 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:52,504 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 13:33:52,504 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 13:33:52,504 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-07 13:33:52,505 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (= main_~tmp~0 0) (= 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|) (<= main_~tmp~0 0) (= 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.offset| 0))) (<= |#NULL.base| 0) (<= 0 main_~tmp~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:52,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 13:33:52,505 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:52,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:52,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:52,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:52,506 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:52,508 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:52,508 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:52,933 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:52,934 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 9] total 18 [2019-10-07 13:33:52,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 13:33:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 13:33:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:33:52,936 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2019-10-07 13:33:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:55,999 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-10-07 13:33:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 13:33:56,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-10-07 13:33:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:56,002 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:33:56,003 INFO L226 Difference]: Without dead ends: 38 [2019-10-07 13:33:56,004 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:33:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-07 13:33:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-10-07 13:33:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:33:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-07 13:33:56,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 13 [2019-10-07 13:33:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:56,011 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-07 13:33:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 13:33:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-07 13:33:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:33:56,012 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:56,012 INFO L385 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:56,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:56,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2029835055, now seen corresponding path program 3 times [2019-10-07 13:33:56,215 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:56,215 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:56,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:56,216 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:56,377 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:56,377 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:56,378 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 13:33:56,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:33:56,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:33:56,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 13:33:56,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:56,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:56,626 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:56,627 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:33:56,627 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:56,628 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:56,628 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:56,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:56,657 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:56,748 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:56,822 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 13:33:56,852 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:56,860 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:56,860 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:56,861 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 13:33:56,861 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 13:33:56,862 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-07 13:33:56,862 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 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|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 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) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:56,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 13:33:56,862 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:56,863 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:56,863 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:56,863 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:56,863 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:56,864 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:56,864 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:57,332 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:57,333 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 26 [2019-10-07 13:33:57,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 13:33:57,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 13:33:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:33:57,335 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2019-10-07 13:33:58,412 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-10-07 13:34:01,741 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-10-07 13:34:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:10,741 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-10-07 13:34:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 13:34:10,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 17 [2019-10-07 13:34:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:10,743 INFO L225 Difference]: With dead ends: 84 [2019-10-07 13:34:10,743 INFO L226 Difference]: Without dead ends: 75 [2019-10-07 13:34:10,744 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=400, Invalid=1580, Unknown=0, NotChecked=0, Total=1980 [2019-10-07 13:34:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-07 13:34:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 29. [2019-10-07 13:34:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:34:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-07 13:34:10,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2019-10-07 13:34:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:10,757 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-07 13:34:10,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 13:34:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-07 13:34:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 13:34:10,758 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:10,759 INFO L385 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:10,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:10,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 45242321, now seen corresponding path program 4 times [2019-10-07 13:34:10,961 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:10,961 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:10,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:10,962 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:11,279 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:11,279 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:34:11,279 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 13:34:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:11,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-07 13:34:11,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:34:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:11,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:34:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:11,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:34:11,937 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:34:11,937 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:34:11,937 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:34:11,937 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:34:11,938 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:34:11,971 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:34:12,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:12,134 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 13:34:12,145 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:34:12,150 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:34:12,150 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:34:12,150 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 13:34:12,150 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 13:34:12,151 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 77#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-07 13:34:12,151 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 72#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 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|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 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) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:34:12,151 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 117#(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 13:34:12,154 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 108#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 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 13:34:12,154 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 98#(and (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:34:12,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:34:12,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 112#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:34:12,155 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 88#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:34:12,156 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 93#(exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:34:12,156 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 103#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 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 13:34:12,900 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:34:12,900 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 9] total 42 [2019-10-07 13:34:12,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-07 13:34:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-07 13:34:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2019-10-07 13:34:12,904 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 42 states. [2019-10-07 13:34:17,412 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-10-07 13:34:18,222 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2019-10-07 13:34:27,468 WARN L191 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 69 DAG size of output: 25 [2019-10-07 13:34:32,264 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-10-07 13:34:38,415 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 25 [2019-10-07 13:34:46,070 WARN L191 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-10-07 13:34:52,709 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 53 DAG size of output: 25 [2019-10-07 13:35:06,000 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2019-10-07 13:35:12,928 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-10-07 13:35:25,743 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-10-07 13:35:33,908 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-10-07 13:35:53,442 WARN L191 SmtUtils]: Spent 7.51 s on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2019-10-07 13:36:12,494 WARN L191 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-10-07 13:36:41,050 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-10-07 13:37:00,917 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 53 DAG size of output: 25 [2019-10-07 13:37:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:37:46,749 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2019-10-07 13:37:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-07 13:37:46,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 25 [2019-10-07 13:37:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:37:46,752 INFO L225 Difference]: With dead ends: 148 [2019-10-07 13:37:46,752 INFO L226 Difference]: Without dead ends: 139 [2019-10-07 13:37:46,755 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 170.0s TimeCoverageRelationStatistics Valid=1445, Invalid=5023, Unknown=12, NotChecked=0, Total=6480 [2019-10-07 13:37:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-07 13:37:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 45. [2019-10-07 13:37:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-07 13:37:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-07 13:37:46,779 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 25 [2019-10-07 13:37:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:37:46,779 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-07 13:37:46,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-07 13:37:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-07 13:37:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:37:46,780 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:37:46,780 INFO L385 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:37:46,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:37:46,981 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:37:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:37:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1543524911, now seen corresponding path program 5 times [2019-10-07 13:37:46,982 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:37:46,983 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:37:46,983 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:37:46,983 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:37:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:37:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:37:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:37:47,779 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:37:47,780 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:37:47,780 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