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/sorting_bubblesort_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:18:16,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:18:16,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:18:16,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:18:16,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:18:16,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:18:16,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:18:16,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:18:16,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:18:16,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:18:16,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:18:16,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:18:16,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:18:16,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:18:16,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:18:16,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:18:16,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:18:16,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:18:16,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:18:16,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:18:16,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:18:16,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:18:16,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:18:16,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:18:16,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:18:16,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:18:16,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:18:16,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:18:16,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:18:16,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:18:16,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:18:16,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:18:16,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:18:16,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:18:16,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:18:16,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:18:16,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:18:16,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:18:16,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:18:16,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:18:16,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:18:16,924 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-06 23:18:16,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:18:16,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:18:16,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:18:16,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:18:16,959 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:18:16,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:18:16,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:18:16,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:18:16,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:18:16,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:18:16,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:18:16,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:18:16,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:18:16,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:18:16,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:18:16,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:18:16,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:18:16,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:18:16,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:18:16,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:18:16,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:18:16,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:18:16,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:18:16,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:18:16,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:18:16,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:18:16,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:18:16,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:18:16,968 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-06 23:18:17,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:18:17,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:18:17,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:18:17,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:18:17,255 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:18:17,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-06 23:18:17,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d320a781/0b85412152e340b5b52821b03c8b0495/FLAG911edf638 [2019-10-06 23:18:17,798 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:18:17,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-06 23:18:17,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d320a781/0b85412152e340b5b52821b03c8b0495/FLAG911edf638 [2019-10-06 23:18:18,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d320a781/0b85412152e340b5b52821b03c8b0495 [2019-10-06 23:18:18,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:18:18,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:18:18,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:18,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:18:18,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:18:18,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d763b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18, skipping insertion in model container [2019-10-06 23:18:18,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,187 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:18:18,206 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:18:18,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:18,396 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:18:18,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:18,444 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:18:18,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18 WrapperNode [2019-10-06 23:18:18,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:18,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:18:18,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:18:18,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:18:18,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (1/1) ... [2019-10-06 23:18:18,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:18:18,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:18:18,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:18:18,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:18:18,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (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-06 23:18:18,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:18:18,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:18:18,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:18:18,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:18:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:18:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:18:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:18:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:18:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:18:19,053 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:18:19,054 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:18:19,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:19 BoogieIcfgContainer [2019-10-06 23:18:19,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:18:19,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:18:19,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:18:19,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:18:19,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:18:18" (1/3) ... [2019-10-06 23:18:19,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ec22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:19, skipping insertion in model container [2019-10-06 23:18:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:18" (2/3) ... [2019-10-06 23:18:19,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ec22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:19, skipping insertion in model container [2019-10-06 23:18:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:19" (3/3) ... [2019-10-06 23:18:19,062 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-1.i [2019-10-06 23:18:19,069 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:18:19,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:18:19,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:18:19,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:18:19,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:18:19,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:18:19,111 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:18:19,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:18:19,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:18:19,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:18:19,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:18:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:18:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:18:19,132 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:19,133 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:19,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-06 23:18:19,146 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:19,147 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:18:19,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,326 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:19,327 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:19,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,347 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-06 23:18:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:19,385 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-06 23:18:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:19,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:18:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:19,396 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:18:19,396 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:18:19,399 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:18:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:18:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:18:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-06 23:18:19,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-06 23:18:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:19,440 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-06 23:18:19,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-06 23:18:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:18:19,441 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:19,441 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:19,441 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-06 23:18:19,442 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:19,443 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,443 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,443 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,491 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-06 23:18:19,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,494 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:19,494 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:19,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,497 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-06 23:18:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:19,512 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-06 23:18:19,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:19,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:18:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:19,514 INFO L225 Difference]: With dead ends: 30 [2019-10-06 23:18:19,514 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:18:19,515 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:18:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:18:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:18:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-06 23:18:19,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-06 23:18:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:19,522 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-06 23:18:19,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-06 23:18:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:18:19,523 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:19,523 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:19,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-06 23:18:19,524 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:19,524 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:19,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,569 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:19,569 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:19,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,570 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-06 23:18:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:19,582 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-06 23:18:19,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:19,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:18:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:19,585 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:18:19,586 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:18:19,586 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:18:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:18:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:18:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:18:19,592 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-06 23:18:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:19,592 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:18:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:18:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:18:19,593 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:19,594 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:19,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:19,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-06 23:18:19,595 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:19,595 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:19,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:18:19,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:19,809 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-06 23:18:19,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:19,845 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-06 23:18:19,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:19,871 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:19,871 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:19,878 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:19,886 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:19,887 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:20,098 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:20,599 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:20,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:20,632 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:20,632 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:20,633 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:20,633 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:20,634 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:20,634 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:20,635 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:20,635 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:20,635 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:20,636 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:20,636 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-06 23:18:20,637 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-06 23:18:20,637 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:20,637 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:18:20,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:20,638 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:18:20,639 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:21,184 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:21,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 20 [2019-10-06 23:18:21,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:18:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:18:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-06 23:18:21,189 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 20 states. [2019-10-06 23:18:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:22,150 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-06 23:18:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:18:22,151 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-10-06 23:18:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:22,154 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:18:22,154 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:18:22,155 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:18:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:18:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-10-06 23:18:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:18:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-06 23:18:22,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-10-06 23:18:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:22,168 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-06 23:18:22,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:18:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-06 23:18:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:18:22,169 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:22,169 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:22,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:22,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1290059680, now seen corresponding path program 2 times [2019-10-06 23:18:22,376 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:22,377 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:22,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:22,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:22,440 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:22,440 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:22,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:22,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:22,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:22,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:18:22,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:22,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:22,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:22,585 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:22,585 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:22,586 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:22,586 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:22,587 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:22,638 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:23,037 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:23,047 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:23,053 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:23,054 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:23,058 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:23,059 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (<= __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-06 23:18:23,059 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (<= __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-06 23:18:23,065 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:23,065 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:23,066 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:23,066 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:23,066 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:23,067 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-06 23:18:23,067 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-06 23:18:23,068 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:23,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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-06 23:18:23,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:23,069 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) [2019-10-06 23:18:23,069 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:23,671 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:23,671 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-06 23:18:23,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:18:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:18:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:18:23,673 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 25 states. [2019-10-06 23:18:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:24,626 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-10-06 23:18:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-06 23:18:24,626 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-06 23:18:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:24,628 INFO L225 Difference]: With dead ends: 61 [2019-10-06 23:18:24,628 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:18:24,632 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:18:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:18:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-06 23:18:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:18:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-06 23:18:24,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2019-10-06 23:18:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:24,643 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-06 23:18:24,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:18:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-06 23:18:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:18:24,647 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:24,647 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:24,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:24,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -799533856, now seen corresponding path program 3 times [2019-10-06 23:18:24,850 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:24,850 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:24,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:24,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:25,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:25,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:25,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:25,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:25,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:25,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:25,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:25,316 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:25,317 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:25,318 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:25,318 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:25,318 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:25,319 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:25,349 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:25,529 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:25,539 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:25,544 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:25,545 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:25,545 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:25,545 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (<= __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-06 23:18:25,545 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (<= __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-06 23:18:25,546 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:25,546 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:25,546 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:25,546 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:25,547 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:25,547 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-06 23:18:25,547 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-06 23:18:25,547 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:25,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:18:25,548 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:25,551 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) [2019-10-06 23:18:25,551 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:26,079 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:26,080 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-06 23:18:26,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:18:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:18:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:18:26,083 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 37 states. [2019-10-06 23:18:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:27,534 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-10-06 23:18:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-06 23:18:27,535 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 27 [2019-10-06 23:18:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:27,536 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:18:27,536 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:18:27,539 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=974, Invalid=3718, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:18:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:18:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-10-06 23:18:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-06 23:18:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-06 23:18:27,548 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 27 [2019-10-06 23:18:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:27,548 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-06 23:18:27,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:18:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-06 23:18:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:18:27,549 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:27,550 INFO L385 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:27,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:27,756 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 317038048, now seen corresponding path program 4 times [2019-10-06 23:18:27,757 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:27,757 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:27,757 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:27,757 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:28,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:28,171 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:28,171 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:28,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:18:28,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:28,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:28,969 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:28,971 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:28,971 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:28,971 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:28,971 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:28,972 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:29,021 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:29,164 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:29,174 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:29,178 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:29,180 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:29,180 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:29,180 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:29,181 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:29,181 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:29,182 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:29,182 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:29,182 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:29,182 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:29,183 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-06 23:18:29,183 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-06 23:18:29,184 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:29,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:18:29,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:29,184 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) [2019-10-06 23:18:29,184 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:29,753 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:29,754 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-06 23:18:29,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:18:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:18:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:18:29,759 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 61 states. [2019-10-06 23:18:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:32,791 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2019-10-06 23:18:32,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-06 23:18:32,792 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 39 [2019-10-06 23:18:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:32,793 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:18:32,794 INFO L226 Difference]: Without dead ends: 80 [2019-10-06 23:18:32,797 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-06 23:18:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-06 23:18:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2019-10-06 23:18:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:18:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-06 23:18:32,808 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 39 [2019-10-06 23:18:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:32,808 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-06 23:18:32,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:18:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-06 23:18:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:18:32,810 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:32,810 INFO L385 BasicCegarLoop]: trace histogram [46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:33,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:33,015 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1926221856, now seen corresponding path program 5 times [2019-10-06 23:18:33,016 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:33,016 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:33,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:33,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:33,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:33,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:33,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:34,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:34,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:34,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:18:34,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:34,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:34,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:34,278 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:34,279 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:34,279 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:34,279 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:34,279 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:34,299 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:34,446 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:34,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:34,455 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:34,455 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:34,455 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:34,455 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:34,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:34,456 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:34,456 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:34,456 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:34,457 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:34,457 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:34,457 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-06 23:18:34,457 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:34,457 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-06 23:18:34,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:18:34,458 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:34,458 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) [2019-10-06 23:18:34,458 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:35,181 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:35,181 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 5, 5, 13] total 67 [2019-10-06 23:18:35,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-06 23:18:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-06 23:18:35,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=3180, Unknown=0, NotChecked=0, Total=4422 [2019-10-06 23:18:35,185 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 67 states. [2019-10-06 23:18:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:39,320 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-10-06 23:18:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:18:39,323 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-10-06 23:18:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:39,324 INFO L225 Difference]: With dead ends: 102 [2019-10-06 23:18:39,324 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:18:39,329 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3742, Invalid=13028, Unknown=0, NotChecked=0, Total=16770 [2019-10-06 23:18:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:18:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2019-10-06 23:18:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-06 23:18:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-06 23:18:39,340 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 63 [2019-10-06 23:18:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:39,340 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-06 23:18:39,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-06 23:18:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-06 23:18:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:18:39,342 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:39,342 INFO L385 BasicCegarLoop]: trace histogram [47, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:39,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:39,550 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1382067436, now seen corresponding path program 6 times [2019-10-06 23:18:39,551 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:39,551 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:39,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:39,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:40,728 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:40,728 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:40,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:40,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:40,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:40,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-06 23:18:40,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:40,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:43,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:43,407 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:43,408 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:43,408 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:43,408 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:43,408 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:43,436 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:43,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:43,563 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:43,565 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:43,566 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:43,566 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,566 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,567 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:43,567 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:43,567 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:43,567 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:43,568 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:43,568 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-06 23:18:43,568 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:43,568 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-06 23:18:43,568 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:18:43,569 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:43,569 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) [2019-10-06 23:18:43,569 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:44,253 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:44,254 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-06 23:18:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:18:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:18:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:18:44,260 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 111 states. [2019-10-06 23:18:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:51,781 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2019-10-06 23:18:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-06 23:18:51,782 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 68 [2019-10-06 23:18:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:51,783 INFO L225 Difference]: With dead ends: 155 [2019-10-06 23:18:51,783 INFO L226 Difference]: Without dead ends: 134 [2019-10-06 23:18:51,787 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-06 23:18:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-06 23:18:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2019-10-06 23:18:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-06 23:18:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-06 23:18:51,801 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 68 [2019-10-06 23:18:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:51,802 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-06 23:18:51,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:18:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-06 23:18:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-06 23:18:51,804 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:51,804 INFO L385 BasicCegarLoop]: trace histogram [96, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:52,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:52,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -693506848, now seen corresponding path program 7 times [2019-10-06 23:18:52,015 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:52,015 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:52,015 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:52,015 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:55,552 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:55,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:55,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:55,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-06 23:18:55,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:55,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:19:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:05,741 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:05,742 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:19:05,742 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:05,743 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:05,743 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:05,743 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:05,774 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:05,976 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:19:05,982 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:05,984 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:05,985 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:05,985 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:05,985 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:05,985 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:05,985 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:05,986 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:19:05,986 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:19:05,986 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:05,986 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:19:05,986 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-06 23:19:05,987 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:19:05,987 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-06 23:19:05,987 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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-06 23:19:05,987 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:05,987 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) [2019-10-06 23:19:05,988 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:19:07,011 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:07,011 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99, 13] total 209 [2019-10-06 23:19:07,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 209 states [2019-10-06 23:19:07,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2019-10-06 23:19:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19345, Invalid=24127, Unknown=0, NotChecked=0, Total=43472 [2019-10-06 23:19:07,020 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 209 states. [2019-10-06 23:19:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:19:32,041 INFO L93 Difference]: Finished difference Result 253 states and 360 transitions. [2019-10-06 23:19:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2019-10-06 23:19:32,041 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 117 [2019-10-06 23:19:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:19:32,044 INFO L225 Difference]: With dead ends: 253 [2019-10-06 23:19:32,044 INFO L226 Difference]: Without dead ends: 232 [2019-10-06 23:19:32,051 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31310 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=57648, Invalid=112508, Unknown=0, NotChecked=0, Total=170156 [2019-10-06 23:19:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-06 23:19:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2019-10-06 23:19:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-06 23:19:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-06 23:19:32,074 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 117 [2019-10-06 23:19:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:19:32,075 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-06 23:19:32,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 209 states. [2019-10-06 23:19:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-06 23:19:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-06 23:19:32,079 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:19:32,079 INFO L385 BasicCegarLoop]: trace histogram [194, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:19:32,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:32,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:19:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:19:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash -833386912, now seen corresponding path program 8 times [2019-10-06 23:19:32,285 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:19:32,285 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:32,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:32,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:45,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:45,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:45,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:46,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:19:46,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:19:46,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:19:46,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:19:46,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:19:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:19:47,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:47,194 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:19:47,194 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:47,195 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:47,195 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:47,195 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:47,214 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:47,320 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:19:47,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:47,326 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:47,326 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:47,326 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:47,327 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:47,327 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:47,327 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:47,327 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:19:47,328 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:19:47,328 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:47,328 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:19:47,328 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-06 23:19:47,328 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:19:47,328 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-06 23:19:47,328 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:19:47,329 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:47,329 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) [2019-10-06 23:19:47,329 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:19:49,071 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:49,072 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 9, 9, 13] total 223 [2019-10-06 23:19:49,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 223 states [2019-10-06 23:19:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2019-10-06 23:19:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19464, Invalid=30042, Unknown=0, NotChecked=0, Total=49506 [2019-10-06 23:19:49,078 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 223 states. [2019-10-06 23:20:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:20:19,379 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2019-10-06 23:20:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-10-06 23:20:19,379 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 215 [2019-10-06 23:20:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:20:19,382 INFO L225 Difference]: With dead ends: 262 [2019-10-06 23:20:19,382 INFO L226 Difference]: Without dead ends: 241 [2019-10-06 23:20:19,390 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31469 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=58424, Invalid=136498, Unknown=0, NotChecked=0, Total=194922 [2019-10-06 23:20:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-06 23:20:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2019-10-06 23:20:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-06 23:20:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 234 transitions. [2019-10-06 23:20:19,409 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 234 transitions. Word has length 215 [2019-10-06 23:20:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:20:19,409 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 234 transitions. [2019-10-06 23:20:19,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 223 states. [2019-10-06 23:20:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2019-10-06 23:20:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-06 23:20:19,413 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:20:19,413 INFO L385 BasicCegarLoop]: trace histogram [195, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:20:19,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:19,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:20:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:20:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2098159852, now seen corresponding path program 9 times [2019-10-06 23:20:19,619 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:20:19,620 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:19,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:19,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:20:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:20:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:33,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:33,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:20:33,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:33,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:20:33,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:20:33,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 197 conjunts are in the unsatisfiable core [2019-10-06 23:20:33,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:20:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:33,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:21:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:21:14,679 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:21:14,680 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:21:14,681 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:21:14,681 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:21:14,681 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:21:14,681 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:21:14,711 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:21:14,815 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:21:14,820 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:21:14,822 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:21:14,822 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:21:14,822 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))) (and (<= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_19) (+ v_prenex_20 4))) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:14,822 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))) (and (<= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_19) (+ v_prenex_20 4))) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))) (and (<= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_19) (+ v_prenex_20 4))) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:21:14,823 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:21:14,823 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-06 23:21:14,824 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:21:14,824 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-06 23:21:14,824 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:21:14,824 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:21:14,824 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))) (and (<= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_19) (+ v_prenex_20 4))) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:21:14,824 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:21:16,522 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:21:16,522 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [198, 198, 198, 13] total 407 [2019-10-06 23:21:16,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 407 states [2019-10-06 23:21:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 407 interpolants. [2019-10-06 23:21:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77854, Invalid=87388, Unknown=0, NotChecked=0, Total=165242 [2019-10-06 23:21:16,535 INFO L87 Difference]: Start difference. First operand 230 states and 234 transitions. Second operand 407 states. [2019-10-06 23:22:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:22:48,582 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-10-06 23:22:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 407 states. [2019-10-06 23:22:48,583 INFO L78 Accepts]: Start accepts. Automaton has 407 states. Word has length 224 [2019-10-06 23:22:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:22:48,587 INFO L225 Difference]: With dead ends: 467 [2019-10-06 23:22:48,587 INFO L226 Difference]: Without dead ends: 438 [2019-10-06 23:22:48,614 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 807 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111698 ImplicationChecksByTransitivity, 141.9s TimeCoverageRelationStatistics Valid=232779, Invalid=420893, Unknown=0, NotChecked=0, Total=653672 [2019-10-06 23:22:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-06 23:22:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 427. [2019-10-06 23:22:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-06 23:22:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 431 transitions. [2019-10-06 23:22:48,640 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 431 transitions. Word has length 224 [2019-10-06 23:22:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:22:48,641 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 431 transitions. [2019-10-06 23:22:48,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 407 states. [2019-10-06 23:22:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 431 transitions. [2019-10-06 23:22:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-06 23:22:48,650 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:22:48,650 INFO L385 BasicCegarLoop]: trace histogram [392, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:22:48,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:22:48,856 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:22:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:22:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1391142432, now seen corresponding path program 10 times [2019-10-06 23:22:48,857 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:22:48,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:22:48,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:48,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:22:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:44,067 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:44,067 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:44,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:44,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 394 conjunts are in the unsatisfiable core [2019-10-06 23:23:44,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:45,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:26:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:26:32,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:26:32,400 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:26:32,400 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:26:32,401 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:26:32,401 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:26:32,401 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:26:32,424 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:32,549 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:26:32,554 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:32,556 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:32,556 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_22) (+ v_prenex_21 4))))))) [2019-10-06 23:26:32,557 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(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_22 Int) (v_prenex_21 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_22) (+ v_prenex_21 4))))))) [2019-10-06 23:26:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(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_22 Int) (v_prenex_21 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_22) (+ v_prenex_21 4))))))) [2019-10-06 23:26:32,557 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:26:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:26:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:26:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:26:32,558 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-06 23:26:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:26:32,558 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-06 23:26:32,559 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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-06 23:26:32,559 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:32,559 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_22 Int) (v_prenex_21 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_22) (+ v_prenex_21 4)))))) [2019-10-06 23:26:32,559 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:26:35,724 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:35,725 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [395, 395, 395, 13] total 801 [2019-10-06 23:26:35,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 801 states [2019-10-06 23:26:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 801 interpolants. [2019-10-06 23:26:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310905, Invalid=329895, Unknown=0, NotChecked=0, Total=640800 [2019-10-06 23:26:35,774 INFO L87 Difference]: Start difference. First operand 427 states and 431 transitions. Second operand 801 states.