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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:43,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:43,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:43,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:43,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:43,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:43,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:43,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:43,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:43,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:43,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:43,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:43,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:43,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:43,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:43,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:43,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:43,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:43,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:43,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:43,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:43,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:43,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:43,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:43,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:43,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:43,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:43,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:43,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:43,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:43,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:43,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:43,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:43,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:43,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:43,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:43,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:43,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:43,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:43,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:43,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:43,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:43,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:43,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:43,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:43,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:43,900 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:43,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:43,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:43,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:43,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:43,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:43,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:43,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:43,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:43,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:43,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:43,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:43,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:43,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:43,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:44,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:44,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:44,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:44,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:44,205 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:44,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-13 21:32:44,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162d76af8/38ba2cb00eec476899a57bb3b9c0a317/FLAG1d50911b2 [2019-10-13 21:32:44,674 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:44,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-13 21:32:44,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162d76af8/38ba2cb00eec476899a57bb3b9c0a317/FLAG1d50911b2 [2019-10-13 21:32:45,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162d76af8/38ba2cb00eec476899a57bb3b9c0a317 [2019-10-13 21:32:45,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:45,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:45,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:45,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:45,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:45,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f216016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45, skipping insertion in model container [2019-10-13 21:32:45,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,042 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:45,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:45,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:45,312 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:45,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:45,374 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:45,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45 WrapperNode [2019-10-13 21:32:45,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:45,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:45,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:45,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:45,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... [2019-10-13 21:32:45,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:45,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:45,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:45,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:45,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:45,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:45,947 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:32:45,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:45 BoogieIcfgContainer [2019-10-13 21:32:45,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:45,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:45,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:45,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:45,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:45" (1/3) ... [2019-10-13 21:32:45,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c36fde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:45, skipping insertion in model container [2019-10-13 21:32:45,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:45" (2/3) ... [2019-10-13 21:32:45,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c36fde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:45, skipping insertion in model container [2019-10-13 21:32:45,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:45" (3/3) ... [2019-10-13 21:32:45,956 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-2.i [2019-10-13 21:32:45,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:45,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:45,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:46,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:46,031 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:46,031 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:46,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:46,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:46,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:46,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:46,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:32:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:46,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:46,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-13 21:32:46,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:46,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169430826] [2019-10-13 21:32:46,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:46,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169430826] [2019-10-13 21:32:46,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:46,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:46,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608641358] [2019-10-13 21:32:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:46,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,255 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:32:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:46,291 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-13 21:32:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:46,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:46,306 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:46,306 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:32:46,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:32:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:32:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:32:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-13 21:32:46,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-13 21:32:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:46,346 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-13 21:32:46,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-13 21:32:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:46,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:46,348 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:46,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-13 21:32:46,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:46,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139281455] [2019-10-13 21:32:46,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:46,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139281455] [2019-10-13 21:32:46,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:46,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:46,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669628628] [2019-10-13 21:32:46,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:46,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,412 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-13 21:32:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:46,430 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:32:46,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:46,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:46,432 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:32:46,432 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:46,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:32:46,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-13 21:32:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:46,440 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:32:46,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:32:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:32:46,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:46,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-13 21:32:46,443 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:46,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974490484] [2019-10-13 21:32:46,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,490 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-13 21:32:46,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974490484] [2019-10-13 21:32:46,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:46,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:46,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339140949] [2019-10-13 21:32:46,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:46,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,493 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:32:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:46,507 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-13 21:32:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:46,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:32:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:46,509 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:46,509 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:32:46,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:32:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:32:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:32:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:32:46,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-13 21:32:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:46,516 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:32:46,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:32:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:32:46,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,518 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:46,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-13 21:32:46,519 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:46,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759947709] [2019-10-13 21:32:46,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759947709] [2019-10-13 21:32:46,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017273778] [2019-10-13 21:32:46,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:46,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,710 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048926153] [2019-10-13 21:32:46,772 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:46,772 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:46,779 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:46,788 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:46,789 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:46,993 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:47,453 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:47,467 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:47,473 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:47,473 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:47,474 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(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-13 21:32:47,474 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 211#(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-13 21:32:47,475 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 220#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:47,475 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 161#(and (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (= 1 main_~swapped~0))) (or (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)) (and (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= 100000 main_~j~0)))) [2019-10-13 21:32:47,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 216#(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-13 21:32:47,476 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 156#(and (or (and (not (< main_~j~0 100000)) (= main_~i~0 1) (= 0 main_~swapped~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0))) (or (and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 1 main_~i~0) (<= main_~i~0 1) (<= 100000 main_~j~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)))) [2019-10-13 21:32:47,476 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 171#(and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~swapped~0 1) (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))) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:47,476 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:47,476 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:47,477 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:47,477 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 197#(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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:47,477 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 225#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:47,477 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:47,478 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(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-13 21:32:47,478 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 192#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:48,015 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:48,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 19 [2019-10-13 21:32:48,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918488916] [2019-10-13 21:32:48,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:32:48,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:32:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:32:48,020 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 19 states. [2019-10-13 21:32:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:48,916 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-13 21:32:48,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:32:48,917 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2019-10-13 21:32:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:48,922 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:32:48,922 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:32:48,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 21:32:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:32:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-10-13 21:32:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:32:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-13 21:32:48,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2019-10-13 21:32:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:48,948 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-13 21:32:48,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:32:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-13 21:32:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:32:48,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:48,950 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:49,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:49,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash -143319426, now seen corresponding path program 2 times [2019-10-13 21:32:49,162 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:49,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332517476] [2019-10-13 21:32:49,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332517476] [2019-10-13 21:32:49,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747163514] [2019-10-13 21:32:49,272 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:49,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:49,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:49,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:49,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,363 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278166338] [2019-10-13 21:32:49,423 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:49,424 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:49,424 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:49,425 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:49,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:49,461 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:49,808 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:49,820 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:49,826 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:49,826 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:49,828 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(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-13 21:32:49,828 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 211#(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-13 21:32:49,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 220#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:49,829 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 161#(and (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (= 1 main_~swapped~0))) (or (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)) (and (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= 100000 main_~j~0)))) [2019-10-13 21:32:49,829 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 216#(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-13 21:32:49,829 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 156#(and (or (and (not (< main_~j~0 100000)) (= main_~i~0 1) (= 0 main_~swapped~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0))) (or (and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 1 main_~i~0) (<= main_~i~0 1) (<= 100000 main_~j~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)))) [2019-10-13 21:32:49,829 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 171#(and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~swapped~0 1) (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))) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,830 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:49,838 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,838 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,838 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 197#(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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:49,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 225#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:49,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(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-13 21:32:49,841 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 192#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:50,335 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:50,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-13 21:32:50,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826700128] [2019-10-13 21:32:50,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:32:50,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:32:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:32:50,337 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 25 states. [2019-10-13 21:32:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,328 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-13 21:32:51,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:32:51,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-13 21:32:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,331 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:32:51,331 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:32:51,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 21:32:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:32:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-10-13 21:32:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:32:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 21:32:51,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2019-10-13 21:32:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,341 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 21:32:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:32:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 21:32:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:32:51,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,343 INFO L380 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1928611330, now seen corresponding path program 3 times [2019-10-13 21:32:51,556 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872363581] [2019-10-13 21:32:51,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872363581] [2019-10-13 21:32:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319879777] [2019-10-13 21:32:51,696 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:51,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:51,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:51,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:51,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:52,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650260390] [2019-10-13 21:32:52,014 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:52,015 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:52,015 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:52,016 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:52,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:52,045 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,225 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:52,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,253 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,254 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,254 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-13 21:32:52,254 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-13 21:32:52,255 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-13 21:32:52,255 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-13 21:32:52,255 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-13 21:32:52,255 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-13 21:32:52,255 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-13 21:32:52,256 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:52,256 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,256 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,256 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-13 21:32:52,256 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-13 21:32:52,258 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,258 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-13 21:32:52,259 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:52,736 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:52,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-13 21:32:52,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304630608] [2019-10-13 21:32:52,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 21:32:52,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 21:32:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:32:52,740 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 37 states. [2019-10-13 21:32:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:54,179 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2019-10-13 21:32:54,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:32:54,180 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 26 [2019-10-13 21:32:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:54,181 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:32:54,182 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 21:32:54,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 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-13 21:32:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 21:32:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-10-13 21:32:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:32:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 21:32:54,193 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2019-10-13 21:32:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:54,194 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 21:32:54,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 21:32:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 21:32:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:32:54,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:54,196 INFO L380 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:54,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:54,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1848185086, now seen corresponding path program 4 times [2019-10-13 21:32:54,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:54,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471832782] [2019-10-13 21:32:54,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:54,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471832782] [2019-10-13 21:32:54,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564054950] [2019-10-13 21:32:54,818 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:32:54,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:54,920 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:55,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [814236203] [2019-10-13 21:32:55,554 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:55,554 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:55,554 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:55,555 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:55,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:55,577 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:55,751 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:55,759 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:55,764 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:55,764 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:55,765 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,765 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 211#(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_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,765 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 220#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:55,765 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 161#(and (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (= 1 main_~swapped~0))) (or (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)) (and (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= 100000 main_~j~0)))) [2019-10-13 21:32:55,766 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 216#(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_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,766 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 156#(and (or (and (not (< main_~j~0 100000)) (= main_~i~0 1) (= 0 main_~swapped~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0))) (or (and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 1 main_~i~0) (<= main_~i~0 1) (<= 100000 main_~j~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)))) [2019-10-13 21:32:55,766 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 171#(and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~swapped~0 1) (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))) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:55,767 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:55,767 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:55,767 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:55,767 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 197#(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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:55,768 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 225#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:55,768 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:55,768 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:32:55,768 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 192#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:56,324 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:56,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-13 21:32:56,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843826491] [2019-10-13 21:32:56,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:32:56,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:32:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:32:56,329 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 61 states. [2019-10-13 21:32:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:59,207 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2019-10-13 21:32:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-13 21:32:59,208 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 38 [2019-10-13 21:32:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:59,209 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:59,209 INFO L226 Difference]: Without dead ends: 79 [2019-10-13 21:32:59,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-13 21:32:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-13 21:32:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2019-10-13 21:32:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:32:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 21:32:59,225 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 38 [2019-10-13 21:32:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:59,225 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 21:32:59,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:32:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 21:32:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:32:59,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:59,227 INFO L380 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:59,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:59,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 390348542, now seen corresponding path program 5 times [2019-10-13 21:32:59,432 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:59,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157723413] [2019-10-13 21:32:59,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:00,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157723413] [2019-10-13 21:33:00,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836716848] [2019-10-13 21:33:00,475 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:00,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:33:00,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:00,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:00,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:33:00,634 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:33:00,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [499587007] [2019-10-13 21:33:00,693 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:00,693 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:00,694 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:00,694 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:00,694 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:00,714 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:00,896 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:00,902 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:00,912 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:00,913 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:00,913 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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-13 21:33:00,913 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 211#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:00,913 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 220#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:00,913 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 161#(and (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (= 1 main_~swapped~0))) (or (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)) (and (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= 100000 main_~j~0)))) [2019-10-13 21:33:00,914 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 216#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:00,914 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 156#(and (or (and (not (< main_~j~0 100000)) (= main_~i~0 1) (= 0 main_~swapped~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0))) (or (and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 1 main_~i~0) (<= main_~i~0 1) (<= 100000 main_~j~0)) (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0)))) [2019-10-13 21:33:00,914 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 171#(and (<= 0 main_~swapped~0) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~swapped~0 1) (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))) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:00,914 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:00,915 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:00,917 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 197#(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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:00,917 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:00,918 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 225#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:00,918 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:00,918 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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-13 21:33:00,919 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 192#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= main_~swapped~0 1) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:01,652 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:01,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 4, 4, 13] total 65 [2019-10-13 21:33:01,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117969244] [2019-10-13 21:33:01,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 21:33:01,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 21:33:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=2931, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 21:33:01,656 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 65 states. [2019-10-13 21:33:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:05,435 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-10-13 21:33:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-13 21:33:05,436 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 62 [2019-10-13 21:33:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:05,438 INFO L225 Difference]: With dead ends: 99 [2019-10-13 21:33:05,438 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:33:05,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3699, Invalid=12051, Unknown=0, NotChecked=0, Total=15750 [2019-10-13 21:33:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:33:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-10-13 21:33:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:33:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-13 21:33:05,453 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 62 [2019-10-13 21:33:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:05,453 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-13 21:33:05,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 21:33:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-13 21:33:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:33:05,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:05,455 INFO L380 BasicCegarLoop]: trace histogram [47, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:05,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:05,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 973546540, now seen corresponding path program 6 times [2019-10-13 21:33:05,669 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:05,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266302643] [2019-10-13 21:33:05,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:06,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266302643] [2019-10-13 21:33:06,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542353131] [2019-10-13 21:33:06,688 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:06,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:06,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:06,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:33:06,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:06,858 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:09,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1890295624] [2019-10-13 21:33:09,345 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:09,345 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:09,346 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:09,346 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:09,346 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:09,368 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:09,490 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:09,495 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:09,497 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:09,498 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:09,498 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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-13 21:33:09,498 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:09,498 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-13 21:33:09,498 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-13 21:33:09,499 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:09,499 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-13 21:33:09,499 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-13 21:33:09,499 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:09,499 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:09,500 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-13 21:33:09,500 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:09,500 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-13 21:33:09,500 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:09,500 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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-13 21:33:09,500 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:10,204 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:10,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-13 21:33:10,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181765109] [2019-10-13 21:33:10,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:33:10,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:33:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:10,212 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 111 states. [2019-10-13 21:33:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:17,619 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2019-10-13 21:33:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-13 21:33:17,619 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 66 [2019-10-13 21:33:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:17,621 INFO L225 Difference]: With dead ends: 151 [2019-10-13 21:33:17,621 INFO L226 Difference]: Without dead ends: 132 [2019-10-13 21:33:17,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-13 21:33:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-13 21:33:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2019-10-13 21:33:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 21:33:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-13 21:33:17,642 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 66 [2019-10-13 21:33:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:17,643 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-13 21:33:17,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-13 21:33:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-13 21:33:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:33:17,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:17,645 INFO L380 BasicCegarLoop]: trace histogram [96, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:17,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:17,849 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 734515488, now seen corresponding path program 7 times [2019-10-13 21:33:17,849 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:17,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051652038] [2019-10-13 21:33:17,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:17,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:21,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051652038] [2019-10-13 21:33:21,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271379797] [2019-10-13 21:33:21,371 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:21,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-13 21:33:21,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:21,621 INFO L321 TraceCheckSpWp]: Computing backward predicates...