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_sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:52,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:52,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:52,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:52,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:52,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:52,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:52,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:52,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:52,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:52,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:52,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:52,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:52,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:52,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:52,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:52,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:52,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:52,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:52,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:52,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:52,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:52,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:52,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:52,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:52,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:52,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:52,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:52,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:52,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:52,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:52,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:52,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:52,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:52,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:52,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:52,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:52,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:52,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:52,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:52,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:52,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:35:52,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:52,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:52,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:52,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:52,956 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:52,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:52,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:52,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:52,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:52,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:52,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:52,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:52,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:52,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:52,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:52,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:52,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:52,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:52,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:52,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:52,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:52,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:52,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:52,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:52,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:52,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:52,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:52,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:52,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:35:53,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:53,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:53,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:53,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:53,248 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:53,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel-2.i [2019-10-13 21:35:53,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7221f72c/58d312ebfb0a41b58f4e03c407761f90/FLAG76b3d6da8 [2019-10-13 21:35:53,821 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:53,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel-2.i [2019-10-13 21:35:53,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7221f72c/58d312ebfb0a41b58f4e03c407761f90/FLAG76b3d6da8 [2019-10-13 21:35:54,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7221f72c/58d312ebfb0a41b58f4e03c407761f90 [2019-10-13 21:35:54,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:54,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:54,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:54,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:54,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:54,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641a6f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54, skipping insertion in model container [2019-10-13 21:35:54,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,215 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:54,230 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:54,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:54,447 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:54,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:54,486 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:54,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54 WrapperNode [2019-10-13 21:35:54,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:54,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:54,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:54,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:54,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... [2019-10-13 21:35:54,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:54,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:54,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:54,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:54,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:54,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:54,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:54,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:54,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:54,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:54,955 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:35:54,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:54 BoogieIcfgContainer [2019-10-13 21:35:54,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:54,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:54,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:54,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:54,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:54" (1/3) ... [2019-10-13 21:35:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:54, skipping insertion in model container [2019-10-13 21:35:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:54" (2/3) ... [2019-10-13 21:35:54,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:54, skipping insertion in model container [2019-10-13 21:35:54,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:54" (3/3) ... [2019-10-13 21:35:54,974 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel-2.i [2019-10-13 21:35:54,983 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:54,991 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:55,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:55,025 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:55,026 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:55,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:55,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:55,026 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:55,026 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:55,026 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:55,026 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:35:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:55,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:55,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,051 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1895073184, now seen corresponding path program 1 times [2019-10-13 21:35:55,064 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593750147] [2019-10-13 21:35:55,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:35:55,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593750147] [2019-10-13 21:35:55,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:55,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:35:55,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664571317] [2019-10-13 21:35:55,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:35:55,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:35:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:35:55,220 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-13 21:35:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:55,245 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 21:35:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:35:55,246 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-13 21:35:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:55,253 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:35:55,253 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 21:35:55,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:35:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 21:35:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-13 21:35:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 21:35:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 21:35:55,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-13 21:35:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:55,289 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 21:35:55,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:35:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 21:35:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:35:55,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:55,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1607168598, now seen corresponding path program 1 times [2019-10-13 21:35:55,293 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481668768] [2019-10-13 21:35:55,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:35:55,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481668768] [2019-10-13 21:35:55,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:55,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:55,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210721214] [2019-10-13 21:35:55,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:55,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:55,371 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-10-13 21:35:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:55,393 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-10-13 21:35:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:55,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:35:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:55,395 INFO L225 Difference]: With dead ends: 23 [2019-10-13 21:35:55,395 INFO L226 Difference]: Without dead ends: 15 [2019-10-13 21:35:55,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-13 21:35:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-13 21:35:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 21:35:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-13 21:35:55,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-10-13 21:35:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:55,402 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-13 21:35:55,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-13 21:35:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:55,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:55,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash -710183188, now seen corresponding path program 1 times [2019-10-13 21:35:55,404 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210403265] [2019-10-13 21:35:55,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:55,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210403265] [2019-10-13 21:35:55,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:55,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:35:55,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874024886] [2019-10-13 21:35:55,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:35:55,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:35:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:35:55,512 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2019-10-13 21:35:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:55,585 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-10-13 21:35:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:35:55,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 21:35:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:55,586 INFO L225 Difference]: With dead ends: 22 [2019-10-13 21:35:55,587 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:35:55,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:35:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:35:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:35:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:35:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-13 21:35:55,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-10-13 21:35:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:55,593 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-13 21:35:55,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:35:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-13 21:35:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:35:55,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:55,595 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1319161073, now seen corresponding path program 1 times [2019-10-13 21:35:55,596 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630325828] [2019-10-13 21:35:55,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:35:55,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630325828] [2019-10-13 21:35:55,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530624] [2019-10-13 21:35:55,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:35:55,792 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:35:55,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188838479] [2019-10-13 21:35:55,848 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:55,849 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:55,856 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:55,867 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:55,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:56,051 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:56,385 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:56,411 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:56,419 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:56,419 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:56,420 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:56,420 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:35:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:35:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:56,422 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:35:56,422 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,422 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,423 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,423 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:56,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:56,424 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:56,811 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:56,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:56,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031199214] [2019-10-13 21:35:56,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:56,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:56,815 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 17 states. [2019-10-13 21:35:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:57,241 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 21:35:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:35:57,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-13 21:35:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:57,242 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:35:57,243 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:35:57,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:35:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:35:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:35:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:35:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-13 21:35:57,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-10-13 21:35:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:57,252 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-13 21:35:57,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-13 21:35:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:35:57,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:57,253 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:57,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:57,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 922897583, now seen corresponding path program 2 times [2019-10-13 21:35:57,467 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:57,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040211455] [2019-10-13 21:35:57,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:57,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:57,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:35:57,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040211455] [2019-10-13 21:35:57,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302156464] [2019-10-13 21:35:57,549 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:57,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:57,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:57,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:35:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:57,808 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:57,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601558486] [2019-10-13 21:35:57,960 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:57,961 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:57,962 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:57,962 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:57,962 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:58,003 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:58,253 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:58,287 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:58,297 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:58,297 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:58,297 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:58,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:58,298 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:35:58,299 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:35:58,299 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:58,299 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:58,300 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:35:58,300 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:58,300 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:58,308 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:58,309 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:58,309 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:58,310 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:58,310 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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-13 21:35:58,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:58,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 11] total 28 [2019-10-13 21:35:58,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84125301] [2019-10-13 21:35:58,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 21:35:58,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 21:35:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:58,769 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 28 states. [2019-10-13 21:36:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:00,058 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-13 21:36:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:36:00,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 19 [2019-10-13 21:36:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:00,060 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:36:00,060 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 21:36:00,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:36:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 21:36:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 21:36:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:36:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-13 21:36:00,069 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-10-13 21:36:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:00,069 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-13 21:36:00,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 21:36:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-13 21:36:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:36:00,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:00,071 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:00,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:00,275 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:00,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:00,275 INFO L82 PathProgramCache]: Analyzing trace with hash -841568069, now seen corresponding path program 3 times [2019-10-13 21:36:00,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:00,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581191915] [2019-10-13 21:36:00,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:00,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:00,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:00,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581191915] [2019-10-13 21:36:00,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253358960] [2019-10-13 21:36:00,371 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:00,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:00,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:00,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:36:00,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:00,459 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:00,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130065755] [2019-10-13 21:36:00,546 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:00,546 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:00,547 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:00,547 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:00,548 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:00,601 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:00,826 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:00,844 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:00,854 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:00,854 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:00,855 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:00,856 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:00,856 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:00,857 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:36:00,857 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:00,857 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:00,857 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:00,858 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:00,858 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:00,858 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:00,859 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:00,859 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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-13 21:36:01,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:01,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:36:01,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321253859] [2019-10-13 21:36:01,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:36:01,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:36:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:36:01,147 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2019-10-13 21:36:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:01,768 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-13 21:36:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:36:01,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-10-13 21:36:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:01,769 INFO L225 Difference]: With dead ends: 46 [2019-10-13 21:36:01,769 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:36:01,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 21:36:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:36:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-13 21:36:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:36:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-10-13 21:36:01,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2019-10-13 21:36:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:01,781 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-10-13 21:36:01,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:36:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-10-13 21:36:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:36:01,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:01,783 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:01,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:01,985 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1957294841, now seen corresponding path program 4 times [2019-10-13 21:36:01,987 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:01,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879258463] [2019-10-13 21:36:01,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:01,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:01,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:02,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879258463] [2019-10-13 21:36:02,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39473067] [2019-10-13 21:36:02,178 INFO L92 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-13 21:36:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:02,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:36:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:02,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:02,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1161303105] [2019-10-13 21:36:02,532 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:02,533 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:02,533 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:02,533 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:02,534 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:02,566 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:02,696 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:02,709 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:02,713 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:02,714 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:02,714 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:02,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:02,714 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:02,715 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:36:02,715 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:02,715 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:02,715 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:02,715 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:02,716 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:02,716 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:02,716 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:02,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:02,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:02,717 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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-13 21:36:03,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:03,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:36:03,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441718347] [2019-10-13 21:36:03,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:36:03,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:36:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:36:03,155 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 39 states. [2019-10-13 21:36:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:04,433 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-10-13 21:36:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:36:04,433 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 31 [2019-10-13 21:36:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:04,435 INFO L225 Difference]: With dead ends: 60 [2019-10-13 21:36:04,435 INFO L226 Difference]: Without dead ends: 46 [2019-10-13 21:36:04,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1237, Invalid=3733, Unknown=0, NotChecked=0, Total=4970 [2019-10-13 21:36:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-13 21:36:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-13 21:36:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:36:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-13 21:36:04,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 31 [2019-10-13 21:36:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:04,449 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-13 21:36:04,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:36:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-13 21:36:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:36:04,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:04,450 INFO L380 BasicCegarLoop]: trace histogram [26, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:04,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:04,655 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:04,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1319947449, now seen corresponding path program 5 times [2019-10-13 21:36:04,656 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:04,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111032577] [2019-10-13 21:36:04,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:04,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:04,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:36:05,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111032577] [2019-10-13 21:36:05,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632597399] [2019-10-13 21:36:05,111 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:36:05,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:36:05,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:05,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 21:36:05,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:36:05,754 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:06,389 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-10-13 21:36:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:36:06,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469648062] [2019-10-13 21:36:06,532 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:06,532 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:06,532 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:06,533 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:06,533 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:06,566 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:06,678 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:06,689 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:06,692 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:06,693 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:06,693 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:06,693 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:06,693 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:06,693 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:36:06,694 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:06,694 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:06,694 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:06,694 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:06,694 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-13 21:36:06,695 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:06,695 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:06,695 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:06,695 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:06,695 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:36:07,215 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:07,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 11, 11] total 58 [2019-10-13 21:36:07,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531310457] [2019-10-13 21:36:07,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-13 21:36:07,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-13 21:36:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2783, Unknown=0, NotChecked=0, Total=3306 [2019-10-13 21:36:07,220 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 58 states. [2019-10-13 21:36:09,916 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-10-13 21:36:10,104 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-13 21:36:10,395 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-10-13 21:36:10,675 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-13 21:36:11,084 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-10-13 21:36:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:11,999 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-10-13 21:36:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-13 21:36:11,999 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 45 [2019-10-13 21:36:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:12,000 INFO L225 Difference]: With dead ends: 75 [2019-10-13 21:36:12,001 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 21:36:12,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1729, Invalid=9613, Unknown=0, NotChecked=0, Total=11342 [2019-10-13 21:36:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 21:36:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-13 21:36:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:36:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-13 21:36:12,014 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-10-13 21:36:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:12,014 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-13 21:36:12,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-13 21:36:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-13 21:36:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:36:12,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:12,018 INFO L380 BasicCegarLoop]: trace histogram [27, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:12,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:12,223 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash 191084431, now seen corresponding path program 6 times [2019-10-13 21:36:12,224 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:12,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479709311] [2019-10-13 21:36:12,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:12,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:12,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:12,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479709311] [2019-10-13 21:36:12,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609844908] [2019-10-13 21:36:12,658 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:36:12,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:12,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:12,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:36:12,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:12,781 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:13,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330644934] [2019-10-13 21:36:13,732 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:13,732 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:13,732 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:13,733 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:13,733 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:13,755 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:13,861 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:13,870 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:13,873 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:13,873 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:13,874 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:13,874 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:13,874 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:13,874 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:36:13,874 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:13,875 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:13,875 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:13,875 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:13,875 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:13,875 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:13,876 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:13,876 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:13,876 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:13,885 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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-13 21:36:14,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:14,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:36:14,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268748546] [2019-10-13 21:36:14,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:36:14,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:36:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:36:14,304 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 69 states. [2019-10-13 21:36:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:17,405 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2019-10-13 21:36:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-13 21:36:17,406 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 54 [2019-10-13 21:36:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:17,408 INFO L225 Difference]: With dead ends: 106 [2019-10-13 21:36:17,409 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 21:36:17,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3660 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5092, Invalid=11938, Unknown=0, NotChecked=0, Total=17030 [2019-10-13 21:36:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 21:36:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-13 21:36:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 21:36:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-10-13 21:36:17,425 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 54 [2019-10-13 21:36:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:17,425 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-10-13 21:36:17,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:36:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-10-13 21:36:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:36:17,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:17,427 INFO L380 BasicCegarLoop]: trace histogram [56, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:17,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:17,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1550959629, now seen corresponding path program 7 times [2019-10-13 21:36:17,630 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:17,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667445611] [2019-10-13 21:36:17,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:17,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:17,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:19,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667445611] [2019-10-13 21:36:19,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181431900] [2019-10-13 21:36:19,041 INFO L92 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-13 21:36:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:19,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:36:19,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:19,215 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:36:22,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339531273] [2019-10-13 21:36:22,849 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:22,849 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:22,849 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:22,850 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:22,850 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:22,875 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:22,982 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:22,991 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:22,994 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:22,994 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:22,994 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:22,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:22,995 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:22,995 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~pos~0 4) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (<= main_~pos~0 100000)) (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000))) [2019-10-13 21:36:22,995 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:22,995 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:22,995 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-13 21:36:22,996 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:22,996 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:22,996 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:22,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:22,996 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:22,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:22,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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-13 21:36:23,549 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:23,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-13 21:36:23,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737470137] [2019-10-13 21:36:23,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-13 21:36:23,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-13 21:36:23,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-13 21:36:23,557 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 127 states. [2019-10-13 21:36:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:33,224 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2019-10-13 21:36:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-10-13 21:36:33,225 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 83 [2019-10-13 21:36:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:33,227 INFO L225 Difference]: With dead ends: 164 [2019-10-13 21:36:33,228 INFO L226 Difference]: Without dead ends: 142 [2019-10-13 21:36:33,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11548 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20201, Invalid=40561, Unknown=0, NotChecked=0, Total=60762 [2019-10-13 21:36:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-13 21:36:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-13 21:36:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-13 21:36:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-10-13 21:36:33,250 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 83 [2019-10-13 21:36:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:33,251 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-10-13 21:36:33,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-13 21:36:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-10-13 21:36:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:36:33,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:33,254 INFO L380 BasicCegarLoop]: trace histogram [114, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:33,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:33,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2110620493, now seen corresponding path program 8 times [2019-10-13 21:36:33,459 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:33,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204757488] [2019-10-13 21:36:33,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat