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_partition_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:45,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:45,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:45,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:45,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:45,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:45,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:45,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:45,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:45,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:45,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:45,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:45,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:45,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:45,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:45,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:45,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:45,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:45,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:45,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:45,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:45,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:45,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:45,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:45,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:45,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:45,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:45,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:45,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:45,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:45,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:45,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:45,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:45,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:45,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:45,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:45,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:45,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:45,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:45,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:45,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:45,746 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:45,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:45,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:45,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:45,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:45,766 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:45,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:45,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:45,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:45,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:45,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:45,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:45,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:45,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:45,767 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:45,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:45,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:45,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:45,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:45,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:45,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:45,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:45,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:45,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:45,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:45,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:45,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:45,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:45,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:45,771 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:46,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:46,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:46,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:46,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:46,069 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:46,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-13 21:35:46,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a115dd0/fd8e340b7fac473ab80acb32e0956a6c/FLAG1006820ae [2019-10-13 21:35:46,610 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:46,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-13 21:35:46,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a115dd0/fd8e340b7fac473ab80acb32e0956a6c/FLAG1006820ae [2019-10-13 21:35:46,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a115dd0/fd8e340b7fac473ab80acb32e0956a6c [2019-10-13 21:35:46,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:46,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:46,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:46,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:46,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:46,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:46" (1/1) ... [2019-10-13 21:35:46,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcdc187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:46, skipping insertion in model container [2019-10-13 21:35:46,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:46" (1/1) ... [2019-10-13 21:35:46,987 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:47,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:47,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:47,219 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:47,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:47,260 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:47,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47 WrapperNode [2019-10-13 21:35:47,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:47,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:47,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:47,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:47,352 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:47" (1/1) ... [2019-10-13 21:35:47,352 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:47" (1/1) ... [2019-10-13 21:35:47,359 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:47" (1/1) ... [2019-10-13 21:35:47,360 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:47" (1/1) ... [2019-10-13 21:35:47,368 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:47" (1/1) ... [2019-10-13 21:35:47,373 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:47" (1/1) ... [2019-10-13 21:35:47,375 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:47" (1/1) ... [2019-10-13 21:35:47,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:47,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:47,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:47,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:47,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (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:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:47,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:47,872 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:35:47,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:47 BoogieIcfgContainer [2019-10-13 21:35:47,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:47,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:47,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:47,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:47,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:46" (1/3) ... [2019-10-13 21:35:47,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7d292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:47, skipping insertion in model container [2019-10-13 21:35:47,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (2/3) ... [2019-10-13 21:35:47,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7d292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:47, skipping insertion in model container [2019-10-13 21:35:47,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:47" (3/3) ... [2019-10-13 21:35:47,882 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-2.i [2019-10-13 21:35:47,892 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:47,900 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:47,911 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:47,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:47,936 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:47,936 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:47,936 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:47,936 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:47,936 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:47,936 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:47,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:35:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:35:47,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:47,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:47,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash 196542356, now seen corresponding path program 1 times [2019-10-13 21:35:47,974 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:47,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094347859] [2019-10-13 21:35:47,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:47,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:47,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,129 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:48,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094347859] [2019-10-13 21:35:48,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:48,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:48,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832412505] [2019-10-13 21:35:48,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:48,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:48,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,153 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:35:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:48,189 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-13 21:35:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:48,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:35:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:48,200 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:35:48,200 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:35:48,204 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:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:35:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:35:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:35:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-13 21:35:48,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-13 21:35:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:48,241 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-13 21:35:48,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-13 21:35:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:48,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,243 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,243 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2146985976, now seen corresponding path program 1 times [2019-10-13 21:35:48,244 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651248168] [2019-10-13 21:35:48,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,321 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:48,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651248168] [2019-10-13 21:35:48,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:48,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:48,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064085359] [2019-10-13 21:35:48,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:48,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,326 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-13 21:35:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:48,366 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:35:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:48,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:35:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:48,368 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:35:48,368 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:35:48,369 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:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:35:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:35:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:35:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-13 21:35:48,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-13 21:35:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:48,376 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-13 21:35:48,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-13 21:35:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:35:48,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1135498834, now seen corresponding path program 1 times [2019-10-13 21:35:48,378 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688576813] [2019-10-13 21:35:48,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,489 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:48,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688576813] [2019-10-13 21:35:48,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557459639] [2019-10-13 21:35:48,490 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:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:48,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:48,606 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:48,606 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:48,648 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:48,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12010164] [2019-10-13 21:35:48,673 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:48,674 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:48,681 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:48,690 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:48,691 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:48,897 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:49,386 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:49,415 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:49,425 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:49,426 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:49,426 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,427 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,427 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,428 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:49,428 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:35:49,428 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:49,429 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:49,430 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:49,430 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:49,430 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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:49,431 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:49,431 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) [2019-10-13 21:35:49,431 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:49,431 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:49,809 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:49,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 19 [2019-10-13 21:35:49,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169636965] [2019-10-13 21:35:49,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:35:49,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:35:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:35:49,814 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 19 states. [2019-10-13 21:35:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:50,526 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-13 21:35:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:35:50,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-10-13 21:35:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:50,528 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:35:50,528 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:35:50,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 21:35:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:35:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-13 21:35:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:35:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-13 21:35:50,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-13 21:35:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:50,541 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-13 21:35:50,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:35:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-13 21:35:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:35:50,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:50,543 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:50,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:50,744 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash -11162668, now seen corresponding path program 2 times [2019-10-13 21:35:50,745 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:50,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751611253] [2019-10-13 21:35:50,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:35:50,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751611253] [2019-10-13 21:35:50,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551313964] [2019-10-13 21:35:50,841 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:50,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:50,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:50,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:35:50,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:35:50,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:35:50,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543595547] [2019-10-13 21:35:50,967 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:50,967 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:50,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:50,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:50,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:51,016 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:51,249 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:51,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:51,291 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:51,291 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:51,292 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-13 21:35:51,292 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-13 21:35:51,292 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-13 21:35:51,292 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:51,293 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:35:51,293 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:51,293 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:51,293 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:51,294 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:51,294 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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:51,294 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:51,294 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4)))))) [2019-10-13 21:35:51,295 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:51,295 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:51,713 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:51,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 12] total 24 [2019-10-13 21:35:51,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201076850] [2019-10-13 21:35:51,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 21:35:51,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 21:35:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:35:51,716 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 24 states. [2019-10-13 21:35:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:52,704 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-13 21:35:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:35:52,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-10-13 21:35:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:52,706 INFO L225 Difference]: With dead ends: 58 [2019-10-13 21:35:52,706 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:35:52,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:35:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:35:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-13 21:35:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:35:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-13 21:35:52,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2019-10-13 21:35:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:52,716 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-13 21:35:52,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 21:35:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-13 21:35:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:35:52,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:52,718 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:52,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:52,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1498178232, now seen corresponding path program 3 times [2019-10-13 21:35:52,923 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:52,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369136995] [2019-10-13 21:35:52,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:52,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:35:53,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369136995] [2019-10-13 21:35:53,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875213501] [2019-10-13 21:35:53,060 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:35:53,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:53,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:53,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:35:53,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:35:53,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:35:53,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [24612816] [2019-10-13 21:35:53,313 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:53,313 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:53,314 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:53,314 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:53,315 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:53,347 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:53,540 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:53,574 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:53,594 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:53,595 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:53,595 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,596 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,599 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,600 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:35:53,600 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:53,601 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:53,601 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:53,601 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:53,602 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:53,605 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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:53,605 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:53,606 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) [2019-10-13 21:35:53,606 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:53,606 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:53,987 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:53,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 12] total 32 [2019-10-13 21:35:53,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546080635] [2019-10-13 21:35:53,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:35:53,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:35:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:35:53,990 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 32 states. [2019-10-13 21:35:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:55,113 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-10-13 21:35:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 21:35:55,114 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-10-13 21:35:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:55,115 INFO L225 Difference]: With dead ends: 75 [2019-10-13 21:35:55,115 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:35:55,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=2827, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:35:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:35:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-13 21:35:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:35:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-13 21:35:55,136 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 30 [2019-10-13 21:35:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:55,140 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-13 21:35:55,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:35:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-13 21:35:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:35:55,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:55,141 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:55,347 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2059227510, now seen corresponding path program 4 times [2019-10-13 21:35:55,348 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335849586] [2019-10-13 21:35:55,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-13 21:35:55,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335849586] [2019-10-13 21:35:55,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538226000] [2019-10-13 21:35:55,515 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:35:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:35:55,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:35:55,777 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:35:56,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116026263] [2019-10-13 21:35:56,121 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:56,121 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:56,122 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:56,122 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:56,122 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:56,147 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:56,304 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:56,315 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:56,318 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:56,319 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:56,319 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,319 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,319 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:35:56,320 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:56,322 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,322 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,322 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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,322 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:56,323 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:35:56,323 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:56,323 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:56,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:56,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 12] total 47 [2019-10-13 21:35:56,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413060257] [2019-10-13 21:35:56,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-13 21:35:56,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-13 21:35:56,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1706, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:35:56,732 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 47 states. [2019-10-13 21:35:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:58,670 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-10-13 21:35:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-13 21:35:58,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 39 [2019-10-13 21:35:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:58,672 INFO L225 Difference]: With dead ends: 93 [2019-10-13 21:35:58,673 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:35:58,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1625, Invalid=6207, Unknown=0, NotChecked=0, Total=7832 [2019-10-13 21:35:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:35:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-13 21:35:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:35:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-10-13 21:35:58,686 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 39 [2019-10-13 21:35:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:58,686 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-10-13 21:35:58,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-13 21:35:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-10-13 21:35:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:35:58,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:58,688 INFO L380 BasicCegarLoop]: trace histogram [26, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:58,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:58,892 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1901916396, now seen corresponding path program 5 times [2019-10-13 21:35:58,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:58,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364053971] [2019-10-13 21:35:58,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:58,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:58,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 21:35:59,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364053971] [2019-10-13 21:35:59,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383396114] [2019-10-13 21:35:59,331 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:35:59,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:35:59,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:59,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:35:59,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-13 21:35:59,677 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-13 21:35:59,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831677674] [2019-10-13 21:35:59,958 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:35:59,958 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:59,958 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:59,958 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:59,959 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:59,980 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:00,145 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:00,151 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:00,154 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:00,154 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:00,154 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:00,154 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:00,156 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:00,156 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:36:00,157 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:00,157 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:00,157 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:00,157 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,157 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:00,158 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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,158 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:00,158 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) [2019-10-13 21:36:00,158 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:00,158 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:36:00,611 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:00,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11, 11, 12] total 58 [2019-10-13 21:36:00,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667697547] [2019-10-13 21:36:00,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-13 21:36:00,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-13 21:36:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2677, Unknown=0, NotChecked=0, Total=3306 [2019-10-13 21:36:00,615 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 58 states. [2019-10-13 21:36:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:04,378 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2019-10-13 21:36:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-13 21:36:04,378 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 55 [2019-10-13 21:36:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:04,380 INFO L225 Difference]: With dead ends: 116 [2019-10-13 21:36:04,380 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 21:36:04,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3983 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3074, Invalid=13696, Unknown=0, NotChecked=0, Total=16770 [2019-10-13 21:36:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 21:36:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-10-13 21:36:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 21:36:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-13 21:36:04,396 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 55 [2019-10-13 21:36:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:04,396 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-13 21:36:04,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-13 21:36:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-13 21:36:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:36:04,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:04,399 INFO L380 BasicCegarLoop]: trace histogram [27, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:04,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:04,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1270431560, now seen corresponding path program 6 times [2019-10-13 21:36:04,613 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:04,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405827253] [2019-10-13 21:36:04,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:04,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:04,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:05,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405827253] [2019-10-13 21:36:05,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845064962] [2019-10-13 21:36:05,096 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:05,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:05,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:05,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:36:05,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:05,255 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:06,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929052789] [2019-10-13 21:36:06,195 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:06,195 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:06,195 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:06,195 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:06,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:06,215 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:06,355 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:06,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:06,366 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:06,367 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:06,367 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:06,367 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:06,367 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:06,367 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:36:06,368 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:06,368 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:06,368 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:06,368 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,368 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:06,369 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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,370 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:06,370 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) [2019-10-13 21:36:06,370 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:06,371 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:36:06,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:06,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 12] total 70 [2019-10-13 21:36:06,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006267907] [2019-10-13 21:36:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-13 21:36:06,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-13 21:36:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1745, Invalid=3085, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 21:36:06,781 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 70 states. [2019-10-13 21:36:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:09,987 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2019-10-13 21:36:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-13 21:36:09,987 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 76 [2019-10-13 21:36:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:09,989 INFO L225 Difference]: With dead ends: 165 [2019-10-13 21:36:09,989 INFO L226 Difference]: Without dead ends: 118 [2019-10-13 21:36:09,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3989 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5114, Invalid=12708, Unknown=0, NotChecked=0, Total=17822 [2019-10-13 21:36:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-13 21:36:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-10-13 21:36:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-13 21:36:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-10-13 21:36:10,007 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 76 [2019-10-13 21:36:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:10,007 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-10-13 21:36:10,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-13 21:36:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-10-13 21:36:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:36:10,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:10,010 INFO L380 BasicCegarLoop]: trace histogram [56, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:10,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:10,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1490670892, now seen corresponding path program 7 times [2019-10-13 21:36:10,213 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:10,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175932241] [2019-10-13 21:36:10,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:10,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:10,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:11,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175932241] [2019-10-13 21:36:11,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148547619] [2019-10-13 21:36:11,580 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:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:11,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:36:11,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:11,795 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:36:15,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [835959641] [2019-10-13 21:36:15,317 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:36:15,317 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:15,318 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:15,318 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:15,318 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:15,345 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:15,476 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:15,482 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:15,487 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:15,488 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:15,488 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:15,488 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:15,488 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:15,488 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-13 21:36:15,489 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:15,489 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:15,489 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:15,489 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:15,489 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:15,489 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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:15,490 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:15,490 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) [2019-10-13 21:36:15,490 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:15,490 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:36:16,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:16,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 12] total 128 [2019-10-13 21:36:16,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660675655] [2019-10-13 21:36:16,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-10-13 21:36:16,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:16,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-10-13 21:36:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6820, Invalid=9436, Unknown=0, NotChecked=0, Total=16256 [2019-10-13 21:36:16,028 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 128 states. [2019-10-13 21:36:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:25,407 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2019-10-13 21:36:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-13 21:36:25,407 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 105 [2019-10-13 21:36:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:25,410 INFO L225 Difference]: With dead ends: 223 [2019-10-13 21:36:25,410 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 21:36:25,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12196 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=20223, Invalid=42027, Unknown=0, NotChecked=0, Total=62250 [2019-10-13 21:36:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 21:36:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2019-10-13 21:36:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-13 21:36:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-10-13 21:36:25,434 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 105 [2019-10-13 21:36:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-10-13 21:36:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-10-13 21:36:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-10-13 21:36:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:36:25,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:25,438 INFO L380 BasicCegarLoop]: trace histogram [114, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:25,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:25,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -278719148, now seen corresponding path program 8 times [2019-10-13 21:36:25,652 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:25,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643810936] [2019-10-13 21:36:25,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:25,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:25,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat