java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:12:40,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:12:40,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:12:40,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:12:40,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:12:40,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:12:40,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:12:40,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:12:40,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:12:40,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:12:40,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:12:40,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:12:40,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:12:40,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:12:40,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:12:40,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:12:40,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:12:40,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:12:40,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:12:40,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:12:40,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:12:40,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:12:40,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:12:40,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:12:40,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:12:40,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:12:40,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:12:40,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:12:40,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:12:40,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:12:40,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:12:40,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:12:40,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:12:40,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:12:40,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:12:40,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:12:40,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:12:40,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:12:40,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:12:40,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:12:40,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:12:40,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:12:40,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:12:40,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:12:40,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:12:40,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:12:40,914 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:12:40,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:12:40,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:12:40,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:12:40,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:12:40,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:12:40,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:12:40,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:12:40,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:12:40,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:12:40,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:12:40,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:12:40,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:12:40,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:12:40,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:12:40,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:12:40,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:12:40,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:12:40,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:12:40,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:12:40,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:12:40,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:12:40,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:12:40,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:12:40,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:12:41,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:12:41,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:12:41,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:12:41,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:12:41,239 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:12:41,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-07 00:12:41,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f075fc92a/1b696020c2dd4f95b24e287fca8c217a/FLAGfe52b6d2a [2019-10-07 00:12:41,796 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:12:41,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-07 00:12:41,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f075fc92a/1b696020c2dd4f95b24e287fca8c217a/FLAGfe52b6d2a [2019-10-07 00:12:42,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f075fc92a/1b696020c2dd4f95b24e287fca8c217a [2019-10-07 00:12:42,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:12:42,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:12:42,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:12:42,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:12:42,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:12:42,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a1ee07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42, skipping insertion in model container [2019-10-07 00:12:42,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:12:42,236 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:12:42,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:12:42,416 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:12:42,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:12:42,452 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:12:42,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42 WrapperNode [2019-10-07 00:12:42,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:12:42,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:12:42,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:12:42,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:12:42,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... [2019-10-07 00:12:42,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:12:42,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:12:42,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:12:42,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:12:42,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:12:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:12:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:12:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:12:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:12:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:12:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:12:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:12:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:12:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:12:43,030 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:12:43,030 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:12:43,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:12:43 BoogieIcfgContainer [2019-10-07 00:12:43,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:12:43,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:12:43,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:12:43,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:12:43,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:12:42" (1/3) ... [2019-10-07 00:12:43,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66481c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:12:43, skipping insertion in model container [2019-10-07 00:12:43,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:42" (2/3) ... [2019-10-07 00:12:43,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66481c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:12:43, skipping insertion in model container [2019-10-07 00:12:43,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:12:43" (3/3) ... [2019-10-07 00:12:43,041 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-2.i [2019-10-07 00:12:43,051 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:12:43,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:12:43,068 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:12:43,089 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:12:43,089 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:12:43,090 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:12:43,090 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:12:43,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:12:43,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:12:43,090 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:12:43,090 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:12:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:12:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:12:43,110 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:43,111 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:43,113 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -242987165, now seen corresponding path program 1 times [2019-10-07 00:12:43,125 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:43,125 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:43,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:43,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:12:43,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:43,285 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:12:43,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:12:43,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:12:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:12:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:12:43,309 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:12:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:43,382 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-07 00:12:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:12:43,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:12:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:43,397 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:12:43,397 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:12:43,405 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:12:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:12:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:12:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:12:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:12:43,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-07 00:12:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:43,463 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:12:43,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:12:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:12:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:12:43,465 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:43,466 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:43,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1448285990, now seen corresponding path program 1 times [2019-10-07 00:12:43,468 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:43,469 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:43,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:43,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:12:43,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:43,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:43,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:12:43,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:12:43,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:12:43,735 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:43,761 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:43,762 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:43,775 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:43,784 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:43,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:43,977 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:44,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:44,327 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:44,334 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:44,335 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:44,335 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:12:44,336 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:12:44,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:44,336 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:44,337 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:12:44,337 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:44,337 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:44,338 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:44,338 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:44,338 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:12:44,339 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:12:44,339 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:12:44,339 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:44,724 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:44,724 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:12:44,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:12:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:12:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:12:44,730 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-07 00:12:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:45,275 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-10-07 00:12:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:12:45,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-07 00:12:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:45,281 INFO L225 Difference]: With dead ends: 38 [2019-10-07 00:12:45,281 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 00:12:45,283 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:12:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 00:12:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-07 00:12:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:12:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:12:45,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:12:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:45,302 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:12:45,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:12:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:12:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:12:45,303 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:45,304 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:45,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:45,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 119243939, now seen corresponding path program 2 times [2019-10-07 00:12:45,508 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:45,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:45,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:45,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:45,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:45,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:45,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:45,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:12:45,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:45,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:12:45,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:45,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:45,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:45,762 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:45,762 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:45,762 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:45,763 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:45,763 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:45,797 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:45,944 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:45,984 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:45,994 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:45,994 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:45,995 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:12:45,995 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:12:45,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:45,996 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:45,996 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:12:45,997 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:45,997 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:45,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:45,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:45,999 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:12:46,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:12:46,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:12:46,000 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:46,343 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:46,343 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-07 00:12:46,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:12:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:12:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:12:46,346 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2019-10-07 00:12:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:47,077 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2019-10-07 00:12:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:12:47,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-07 00:12:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:47,080 INFO L225 Difference]: With dead ends: 53 [2019-10-07 00:12:47,080 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:12:47,082 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 00:12:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:12:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-07 00:12:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 00:12:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-07 00:12:47,091 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2019-10-07 00:12:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:47,092 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-07 00:12:47,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:12:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-07 00:12:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 00:12:47,093 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:47,093 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:47,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:47,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash 92938371, now seen corresponding path program 3 times [2019-10-07 00:12:47,305 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:47,305 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:47,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:47,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:47,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:47,480 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:47,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:47,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:12:47,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:47,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:12:47,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:47,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:47,788 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:47,789 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:47,789 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:47,789 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:47,789 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:47,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:47,829 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:47,970 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:47,997 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:48,005 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:48,005 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:48,006 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:12:48,007 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:12:48,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:48,011 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:48,011 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:12:48,012 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:48,012 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:48,012 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:48,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:48,014 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:12:48,015 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:12:48,015 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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-07 00:12:48,016 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:48,360 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:48,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-07 00:12:48,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:12:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:12:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:12:48,364 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 35 states. [2019-10-07 00:12:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:49,682 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2019-10-07 00:12:49,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-07 00:12:49,690 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2019-10-07 00:12:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:49,691 INFO L225 Difference]: With dead ends: 83 [2019-10-07 00:12:49,691 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 00:12:49,700 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=979, Invalid=3053, Unknown=0, NotChecked=0, Total=4032 [2019-10-07 00:12:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 00:12:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-10-07 00:12:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-07 00:12:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-07 00:12:49,715 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-10-07 00:12:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:49,716 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-07 00:12:49,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:12:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-07 00:12:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 00:12:49,720 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:49,720 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:49,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:49,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:49,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:49,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1097584707, now seen corresponding path program 4 times [2019-10-07 00:12:49,930 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:49,931 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:49,931 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:49,931 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:12:50,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:50,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:50,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:50,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:12:50,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:12:50,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:12:51,146 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:51,147 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:51,147 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:51,147 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:51,148 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:51,148 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:51,176 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:51,261 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:51,276 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:51,280 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:51,281 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:51,281 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:12:51,281 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:12:51,281 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:51,282 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:51,282 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:12:51,282 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:51,282 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:51,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:12:51,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:51,283 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:12:51,283 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:12:51,283 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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-07 00:12:51,284 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:51,677 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:51,677 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-07 00:12:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-07 00:12:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-07 00:12:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2216, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:12:51,681 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 59 states. [2019-10-07 00:12:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:54,766 INFO L93 Difference]: Finished difference Result 143 states and 195 transitions. [2019-10-07 00:12:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-07 00:12:54,767 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2019-10-07 00:12:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:54,769 INFO L225 Difference]: With dead ends: 143 [2019-10-07 00:12:54,770 INFO L226 Difference]: Without dead ends: 111 [2019-10-07 00:12:54,773 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3607, Invalid=8825, Unknown=0, NotChecked=0, Total=12432 [2019-10-07 00:12:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-07 00:12:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-10-07 00:12:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-07 00:12:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-07 00:12:54,790 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 56 [2019-10-07 00:12:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:54,791 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-07 00:12:54,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-07 00:12:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-07 00:12:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 00:12:54,794 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:54,794 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:54,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:54,999 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1168568381, now seen corresponding path program 5 times [2019-10-07 00:12:55,000 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:55,000 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:55,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:55,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:12:56,061 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:56,061 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:56,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:12,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:13:12,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:13:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:13:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:13:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:13:12,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:13:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:13:15,350 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:13:15,351 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:13:15,352 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:13:15,352 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:13:15,352 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:13:15,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:13:15,377 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:13:15,471 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:13:15,486 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:13:15,489 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:13:15,489 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:13:15,490 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:13:15,490 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:13:15,490 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:13:15,491 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:15,491 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:13:15,491 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:13:15,491 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 00:13:15,491 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:13:15,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:13:15,494 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:13:15,495 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:13:15,495 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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-07 00:13:15,495 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:15,977 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:13:15,977 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 11] total 107 [2019-10-07 00:13:15,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-07 00:13:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-07 00:13:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4686, Invalid=6656, Unknown=0, NotChecked=0, Total=11342 [2019-10-07 00:13:15,983 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 107 states. [2019-10-07 00:13:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:13:24,310 INFO L93 Difference]: Finished difference Result 263 states and 363 transitions. [2019-10-07 00:13:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-07 00:13:24,310 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 104 [2019-10-07 00:13:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:13:24,313 INFO L225 Difference]: With dead ends: 263 [2019-10-07 00:13:24,313 INFO L226 Difference]: Without dead ends: 207 [2019-10-07 00:13:24,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8407 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14047, Invalid=29009, Unknown=0, NotChecked=0, Total=43056 [2019-10-07 00:13:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-07 00:13:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2019-10-07 00:13:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-07 00:13:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2019-10-07 00:13:24,346 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 104 [2019-10-07 00:13:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:13:24,346 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2019-10-07 00:13:24,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-07 00:13:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2019-10-07 00:13:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 00:13:24,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:13:24,350 INFO L385 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:13:24,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:24,552 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:13:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:13:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash -577040701, now seen corresponding path program 6 times [2019-10-07 00:13:24,553 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:13:24,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:24,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:24,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:13:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:13:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:13:28,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:28,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:13:28,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:28,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:13:28,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:13:28,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:13:28,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:13:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:13:28,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:13:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:13:38,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:13:38,528 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:13:38,528 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:13:38,529 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:13:38,529 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:13:38,529 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:13:38,568 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:13:38,635 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:13:38,645 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:13:38,648 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:13:38,648 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:13:38,648 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:13:38,649 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:13:38,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:13:38,649 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:38,649 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:13:38,650 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:13:38,650 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:13:38,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:13:38,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:13:38,650 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:13:38,651 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:13:38,651 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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-07 00:13:38,651 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:39,371 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:13:39,372 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 11] total 203 [2019-10-07 00:13:39,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-07 00:13:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-07 00:13:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18558, Invalid=22448, Unknown=0, NotChecked=0, Total=41006 [2019-10-07 00:13:39,379 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 203 states. [2019-10-07 00:14:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:10,387 INFO L93 Difference]: Finished difference Result 503 states and 699 transitions. [2019-10-07 00:14:10,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2019-10-07 00:14:10,389 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 200 [2019-10-07 00:14:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:10,392 INFO L225 Difference]: With dead ends: 503 [2019-10-07 00:14:10,392 INFO L226 Difference]: Without dead ends: 399 [2019-10-07 00:14:10,400 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28351 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=55663, Invalid=103937, Unknown=0, NotChecked=0, Total=159600 [2019-10-07 00:14:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-07 00:14:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-10-07 00:14:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-07 00:14:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 398 transitions. [2019-10-07 00:14:10,450 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 398 transitions. Word has length 200 [2019-10-07 00:14:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:10,450 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 398 transitions. [2019-10-07 00:14:10,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 203 states. [2019-10-07 00:14:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 398 transitions. [2019-10-07 00:14:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-07 00:14:10,466 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:10,467 INFO L385 BasicCegarLoop]: trace histogram [190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:10,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:10,669 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1883435837, now seen corresponding path program 7 times [2019-10-07 00:14:10,670 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:10,670 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:10,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:10,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:14:24,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:24,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:24,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:24,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 00:14:24,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:14:24,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:15:02,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:02,729 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:02,729 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:02,729 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:02,730 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:02,730 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:02,773 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:02,832 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:02,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:02,843 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:02,844 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:02,846 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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-07 00:15:02,846 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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-07 00:15:02,846 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:02,847 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:02,847 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-07 00:15:02,847 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:02,847 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:02,847 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:02,848 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:02,848 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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-07 00:15:02,848 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:02,848 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:15:02,848 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:03,993 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:03,994 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 11] total 395 [2019-10-07 00:15:03,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 395 states [2019-10-07 00:15:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 395 interpolants. [2019-10-07 00:15:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73950, Invalid=81680, Unknown=0, NotChecked=0, Total=155630 [2019-10-07 00:15:04,012 INFO L87 Difference]: Start difference. First operand 396 states and 398 transitions. Second operand 395 states. [2019-10-07 00:18:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:18:02,323 INFO L93 Difference]: Finished difference Result 983 states and 1371 transitions. [2019-10-07 00:18:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 394 states. [2019-10-07 00:18:02,324 INFO L78 Accepts]: Start accepts. Automaton has 395 states. Word has length 392 [2019-10-07 00:18:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:18:02,330 INFO L225 Difference]: With dead ends: 983 [2019-10-07 00:18:02,330 INFO L226 Difference]: Without dead ends: 783 [2019-10-07 00:18:02,348 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 1358 SyntacticMatches, 0 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102799 ImplicationChecksByTransitivity, 136.1s TimeCoverageRelationStatistics Valid=221839, Invalid=392033, Unknown=0, NotChecked=0, Total=613872 [2019-10-07 00:18:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-07 00:18:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2019-10-07 00:18:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-10-07 00:18:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 782 transitions. [2019-10-07 00:18:02,398 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 782 transitions. Word has length 392 [2019-10-07 00:18:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:18:02,399 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 782 transitions. [2019-10-07 00:18:02,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 395 states. [2019-10-07 00:18:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 782 transitions. [2019-10-07 00:18:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2019-10-07 00:18:02,421 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:18:02,422 INFO L385 BasicCegarLoop]: trace histogram [382, 382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:18:02,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:18:02,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:18:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:18:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash -763819837, now seen corresponding path program 8 times [2019-10-07 00:18:02,638 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:18:02,638 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:18:02,639 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:18:02,639 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:18:02,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:18:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:18:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 146306 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 73153 trivial. 0 not checked. [2019-10-07 00:18:54,509 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:18:54,509 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:18:54,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true