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_2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:18:01,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:18:01,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:18:01,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:18:01,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:18:01,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:18:01,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:18:01,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:18:01,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:18:01,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:18:01,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:18:01,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:18:01,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:18:01,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:18:01,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:18:01,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:18:01,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:18:01,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:18:01,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:18:01,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:18:01,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:18:01,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:18:01,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:18:01,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:18:01,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:18:01,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:18:01,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:18:01,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:18:01,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:18:01,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:18:01,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:18:01,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:18:01,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:18:01,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:18:01,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:18:01,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:18:01,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:18:01,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:18:01,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:18:01,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:18:01,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:18:01,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:18:01,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:18:01,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:18:01,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:18:01,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:18:01,587 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:18:01,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:18:01,588 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:18:01,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:18:01,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:18:01,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:18:01,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:18:01,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:18:01,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:18:01,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:18:01,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:18:01,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:18:01,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:18:01,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:18:01,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:18:01,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:18:01,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:18:01,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:18:01,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:18:01,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:18:01,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:18:01,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:18:01,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:18:01,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:18:01,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:18:01,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:18:01,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:18:01,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:18:01,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:18:01,908 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:18:01,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-06 23:18:01,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e3a8a9a/da63f5a68c884c88afe7df56a5eb0ca8/FLAG51bcd45dd [2019-10-06 23:18:02,457 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:18:02,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-06 23:18:02,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e3a8a9a/da63f5a68c884c88afe7df56a5eb0ca8/FLAG51bcd45dd [2019-10-06 23:18:02,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e3a8a9a/da63f5a68c884c88afe7df56a5eb0ca8 [2019-10-06 23:18:02,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:18:02,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:18:02,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:02,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:18:02,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:18:02,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:02" (1/1) ... [2019-10-06 23:18:02,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cf440b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:02, skipping insertion in model container [2019-10-06 23:18:02,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:02" (1/1) ... [2019-10-06 23:18:02,863 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:18:02,887 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:18:03,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:03,110 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:18:03,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:03,151 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:18:03,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03 WrapperNode [2019-10-06 23:18:03,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:03,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:18:03,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:18:03,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:18:03,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... [2019-10-06 23:18:03,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:18:03,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:18:03,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:18:03,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:18:03,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:18:03,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:18:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:18:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:18:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:18:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:18:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:18:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:18:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:18:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:18:03,774 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:18:03,775 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:18:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:03 BoogieIcfgContainer [2019-10-06 23:18:03,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:18:03,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:18:03,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:18:03,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:18:03,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:18:02" (1/3) ... [2019-10-06 23:18:03,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21167724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:03, skipping insertion in model container [2019-10-06 23:18:03,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:03" (2/3) ... [2019-10-06 23:18:03,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21167724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:03, skipping insertion in model container [2019-10-06 23:18:03,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:03" (3/3) ... [2019-10-06 23:18:03,783 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_2_ground.i [2019-10-06 23:18:03,792 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:18:03,799 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:18:03,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:18:03,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:18:03,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:18:03,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:18:03,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:18:03,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:18:03,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:18:03,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:18:03,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:18:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:18:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:18:03,858 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:03,859 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:03,861 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-06 23:18:03,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:03,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:03,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:03,874 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:18:04,033 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,033 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:04,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:04,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,051 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-06 23:18:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:04,089 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-06 23:18:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:04,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:18:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:04,100 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:18:04,100 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:18:04,104 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:18:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:18:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:18:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-06 23:18:04,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-06 23:18:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:04,152 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-06 23:18:04,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-06 23:18:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:18:04,153 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:04,153 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:04,154 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-06 23:18:04,155 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:04,155 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:04,206 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,206 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:04,207 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:04,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,209 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-06 23:18:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:04,225 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-06 23:18:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:04,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:18:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:04,227 INFO L225 Difference]: With dead ends: 30 [2019-10-06 23:18:04,228 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:18:04,229 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:18:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:18:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:18:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-06 23:18:04,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-06 23:18:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:04,236 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-06 23:18:04,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-06 23:18:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:18:04,238 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:04,238 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:04,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-06 23:18:04,240 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:04,240 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,240 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:04,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,309 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:04,309 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:04,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,311 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-06 23:18:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:04,330 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-06 23:18:04,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:04,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:18:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:04,336 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:18:04,336 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:18:04,337 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:18:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:18:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:18:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:18:04,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-06 23:18:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:04,348 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:18:04,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:18:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:18:04,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:04,350 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:04,351 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-06 23:18:04,352 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:04,352 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:04,456 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:04,458 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:18:04,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:18:04,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:18:04,630 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:04,664 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:04,665 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:04,675 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:04,684 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:04,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:04,879 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:05,370 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:05,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:05,391 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:05,391 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:05,392 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:05,392 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:05,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:05,393 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:05,393 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:05,393 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:05,394 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:05,394 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:05,394 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:05,394 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:05,395 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:05,395 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:05,395 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:05,395 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:18:05,396 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:06,010 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:06,011 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 20 [2019-10-06 23:18:06,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:18:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:18:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-06 23:18:06,015 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 20 states. [2019-10-06 23:18:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:06,990 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-06 23:18:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:18:06,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-10-06 23:18:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:06,994 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:18:06,994 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:18:06,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:18:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:18:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-10-06 23:18:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:18:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-06 23:18:07,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-10-06 23:18:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:07,009 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-06 23:18:07,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:18:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-06 23:18:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:18:07,010 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:07,010 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:07,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:07,217 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1290059680, now seen corresponding path program 2 times [2019-10-06 23:18:07,217 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:07,217 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:07,218 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:07,218 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:07,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:07,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:07,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:07,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:07,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:18:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:07,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:07,421 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:07,422 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:07,422 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:07,423 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:07,423 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:07,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:07,453 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:07,728 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:07,739 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:07,746 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:07,747 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:07,751 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 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_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:07,751 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 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_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:07,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:07,752 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:07,752 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 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_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:07,752 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:07,753 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:07,753 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:07,753 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:07,754 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:07,754 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:07,754 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:07,754 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:07,758 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 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_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) [2019-10-06 23:18:07,759 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:08,350 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:08,351 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-06 23:18:08,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:18:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:18:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:18:08,356 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 25 states. [2019-10-06 23:18:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:09,351 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-10-06 23:18:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-06 23:18:09,351 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-06 23:18:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:09,353 INFO L225 Difference]: With dead ends: 61 [2019-10-06 23:18:09,353 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:18:09,354 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:18:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:18:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-06 23:18:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:18:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-06 23:18:09,363 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2019-10-06 23:18:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:09,363 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-06 23:18:09,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:18:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-06 23:18:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:18:09,364 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:09,365 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:09,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:09,568 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -799533856, now seen corresponding path program 3 times [2019-10-06 23:18:09,569 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:09,569 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:09,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:09,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:09,754 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:09,754 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:09,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:09,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:09,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:09,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:10,104 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:10,106 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:10,106 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:10,106 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:10,107 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:10,107 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:10,131 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:10,350 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:10,361 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:10,367 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:10,367 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:10,367 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 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_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:10,367 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 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_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:10,368 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:10,368 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:10,368 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 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_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:10,369 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:10,369 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:10,369 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:10,369 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:10,370 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:10,370 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:10,370 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:10,370 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:10,371 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 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_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) [2019-10-06 23:18:10,371 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:10,851 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:10,852 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-06 23:18:10,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:18:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:18:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:18:10,854 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 37 states. [2019-10-06 23:18:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:12,375 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-10-06 23:18:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-06 23:18:12,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 27 [2019-10-06 23:18:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:12,378 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:18:12,378 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:18:12,380 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=974, Invalid=3718, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:18:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:18:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-10-06 23:18:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-06 23:18:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-06 23:18:12,390 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 27 [2019-10-06 23:18:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:12,390 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-06 23:18:12,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:18:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-06 23:18:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:18:12,392 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:12,392 INFO L385 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:12,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:12,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 317038048, now seen corresponding path program 4 times [2019-10-06 23:18:12,594 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:12,595 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:12,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:12,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:12,967 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:12,967 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:12,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:13,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:18:13,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:13,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:13,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:13,762 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:13,763 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:13,763 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:13,763 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:13,764 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:13,791 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:13,943 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:13,949 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:13,953 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:13,953 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:13,953 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:13,953 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:13,954 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:13,954 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:13,954 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:13,954 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:13,955 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:13,955 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:13,955 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:13,955 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:13,956 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:13,956 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:13,956 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:13,956 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) [2019-10-06 23:18:13,956 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:14,631 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:14,631 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-06 23:18:14,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:18:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:18:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:18:14,636 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 61 states. [2019-10-06 23:18:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:17,666 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2019-10-06 23:18:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-06 23:18:17,667 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 39 [2019-10-06 23:18:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:17,669 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:18:17,669 INFO L226 Difference]: Without dead ends: 80 [2019-10-06 23:18:17,675 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-06 23:18:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-06 23:18:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2019-10-06 23:18:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:18:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-06 23:18:17,686 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 39 [2019-10-06 23:18:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:17,687 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-06 23:18:17,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:18:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-06 23:18:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:18:17,689 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:17,689 INFO L385 BasicCegarLoop]: trace histogram [46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:17,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:17,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1926221856, now seen corresponding path program 5 times [2019-10-06 23:18:17,894 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:17,894 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:17,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:17,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:18,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:18,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:18,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:19,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:19,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:19,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:18:19,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:19,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:19,227 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:19,228 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:19,229 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:19,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:19,229 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:19,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:19,252 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:19,400 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:19,406 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:19,409 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:19,409 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:19,409 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (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)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:19,410 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (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)) (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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:19,410 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (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)) (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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:19,411 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:19,412 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:19,412 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:18:19,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:19,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:19,412 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (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)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) [2019-10-06 23:18:19,413 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:20,172 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:20,173 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 5, 5, 13] total 67 [2019-10-06 23:18:20,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-06 23:18:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-06 23:18:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=3180, Unknown=0, NotChecked=0, Total=4422 [2019-10-06 23:18:20,177 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 67 states. [2019-10-06 23:18:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:24,358 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-10-06 23:18:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:18:24,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-10-06 23:18:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:24,362 INFO L225 Difference]: With dead ends: 102 [2019-10-06 23:18:24,362 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:18:24,367 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3742, Invalid=13028, Unknown=0, NotChecked=0, Total=16770 [2019-10-06 23:18:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:18:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2019-10-06 23:18:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-06 23:18:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-06 23:18:24,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 63 [2019-10-06 23:18:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:24,379 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-06 23:18:24,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-06 23:18:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-06 23:18:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:18:24,381 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:24,381 INFO L385 BasicCegarLoop]: trace histogram [47, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:24,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:24,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1382067436, now seen corresponding path program 6 times [2019-10-06 23:18:24,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:24,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:24,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:24,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:25,605 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:25,605 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:25,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:25,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:25,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:25,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-06 23:18:25,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:25,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:28,380 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:28,381 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:28,381 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:28,381 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:28,382 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:28,382 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:28,400 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:28,539 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:28,549 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:28,554 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:28,554 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:28,555 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:28,555 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:28,555 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:28,555 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:28,555 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:28,556 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:28,556 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:28,556 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:28,556 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:28,556 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:28,557 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:28,557 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:28,557 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:28,557 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) [2019-10-06 23:18:28,557 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:29,258 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:29,258 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-06 23:18:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:18:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:18:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:18:29,264 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 111 states. [2019-10-06 23:18:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:36,987 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2019-10-06 23:18:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-06 23:18:36,988 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 68 [2019-10-06 23:18:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:36,990 INFO L225 Difference]: With dead ends: 155 [2019-10-06 23:18:36,990 INFO L226 Difference]: Without dead ends: 134 [2019-10-06 23:18:36,994 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-06 23:18:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-06 23:18:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2019-10-06 23:18:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-06 23:18:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-06 23:18:37,009 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 68 [2019-10-06 23:18:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:37,009 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-06 23:18:37,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:18:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-06 23:18:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-06 23:18:37,011 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:37,011 INFO L385 BasicCegarLoop]: trace histogram [96, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:37,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:37,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash -693506848, now seen corresponding path program 7 times [2019-10-06 23:18:37,217 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:37,217 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:37,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:37,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:40,858 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:40,858 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:40,858 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:41,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-06 23:18:41,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:41,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:52,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:52,037 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:52,037 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:52,038 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:52,038 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:52,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:52,055 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:52,195 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:52,205 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:52,207 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:52,207 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:52,208 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (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| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:52,208 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (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| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:52,208 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:52,208 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (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| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:52,209 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:52,209 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:52,209 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:52,209 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:52,209 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:52,210 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:52,210 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:52,210 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:52,210 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:52,210 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (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| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) [2019-10-06 23:18:52,211 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:53,253 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:53,253 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99, 13] total 209 [2019-10-06 23:18:53,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 209 states [2019-10-06 23:18:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2019-10-06 23:18:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19345, Invalid=24127, Unknown=0, NotChecked=0, Total=43472 [2019-10-06 23:18:53,262 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 209 states. [2019-10-06 23:19:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:19:18,535 INFO L93 Difference]: Finished difference Result 253 states and 360 transitions. [2019-10-06 23:19:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2019-10-06 23:19:18,536 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 117 [2019-10-06 23:19:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:19:18,538 INFO L225 Difference]: With dead ends: 253 [2019-10-06 23:19:18,538 INFO L226 Difference]: Without dead ends: 232 [2019-10-06 23:19:18,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31310 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=57648, Invalid=112508, Unknown=0, NotChecked=0, Total=170156 [2019-10-06 23:19:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-06 23:19:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2019-10-06 23:19:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-06 23:19:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-06 23:19:18,586 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 117 [2019-10-06 23:19:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:19:18,587 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-06 23:19:18,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 209 states. [2019-10-06 23:19:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-06 23:19:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-06 23:19:18,591 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:19:18,591 INFO L385 BasicCegarLoop]: trace histogram [194, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:19:18,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:18,796 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:19:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:19:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -833386912, now seen corresponding path program 8 times [2019-10-06 23:19:18,797 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:19:18,797 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:18,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:18,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:32,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:32,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:32,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:33,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:19:33,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:19:33,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:19:33,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:19:33,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:19:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:19:34,257 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:34,259 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:19:34,259 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:34,260 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:34,260 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:34,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:34,282 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:34,405 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:19:34,411 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:34,417 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:34,418 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:34,418 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_15) v_prenex_16) (select (select |#memory_int| v_prenex_15) (+ v_prenex_16 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:34,418 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_15) v_prenex_16) (select (select |#memory_int| v_prenex_15) (+ v_prenex_16 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:34,418 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_15) v_prenex_16) (select (select |#memory_int| v_prenex_15) (+ v_prenex_16 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:19:34,419 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:19:34,421 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:19:34,421 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:19:34,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:19:34,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:34,421 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_15) v_prenex_16) (select (select |#memory_int| v_prenex_15) (+ v_prenex_16 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) [2019-10-06 23:19:34,422 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:19:36,211 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:36,212 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 9, 9, 13] total 223 [2019-10-06 23:19:36,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 223 states [2019-10-06 23:19:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2019-10-06 23:19:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19464, Invalid=30042, Unknown=0, NotChecked=0, Total=49506 [2019-10-06 23:19:36,218 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 223 states. [2019-10-06 23:20:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:20:07,510 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2019-10-06 23:20:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-10-06 23:20:07,511 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 215 [2019-10-06 23:20:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:20:07,514 INFO L225 Difference]: With dead ends: 262 [2019-10-06 23:20:07,514 INFO L226 Difference]: Without dead ends: 241 [2019-10-06 23:20:07,521 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31469 ImplicationChecksByTransitivity, 45.7s TimeCoverageRelationStatistics Valid=58424, Invalid=136498, Unknown=0, NotChecked=0, Total=194922 [2019-10-06 23:20:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-06 23:20:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2019-10-06 23:20:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-06 23:20:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 234 transitions. [2019-10-06 23:20:07,537 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 234 transitions. Word has length 215 [2019-10-06 23:20:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:20:07,538 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 234 transitions. [2019-10-06 23:20:07,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 223 states. [2019-10-06 23:20:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2019-10-06 23:20:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-06 23:20:07,542 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:20:07,542 INFO L385 BasicCegarLoop]: trace histogram [195, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:20:07,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:07,751 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:20:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:20:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2098159852, now seen corresponding path program 9 times [2019-10-06 23:20:07,752 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:20:07,752 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:07,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:07,753 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:20:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:20:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:21,544 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:21,544 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:20:21,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:21,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:20:21,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:20:21,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 197 conjunts are in the unsatisfiable core [2019-10-06 23:20:21,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:20:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:22,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:21:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:21:03,417 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:21:03,418 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:21:03,418 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:21:03,419 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:21:03,419 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:21:03,419 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:21:03,440 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:21:03,562 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:21:03,567 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:21:03,570 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:21:03,570 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:21:03,570 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:03,570 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:03,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:21:03,571 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:21:03,572 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:21:03,572 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:21:03,572 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:21:03,572 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) [2019-10-06 23:21:03,572 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:21:05,294 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:21:05,294 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [198, 198, 198, 13] total 407 [2019-10-06 23:21:05,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 407 states [2019-10-06 23:21:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 407 interpolants. [2019-10-06 23:21:05,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77854, Invalid=87388, Unknown=0, NotChecked=0, Total=165242 [2019-10-06 23:21:05,307 INFO L87 Difference]: Start difference. First operand 230 states and 234 transitions. Second operand 407 states. [2019-10-06 23:22:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:22:38,263 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-10-06 23:22:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 407 states. [2019-10-06 23:22:38,264 INFO L78 Accepts]: Start accepts. Automaton has 407 states. Word has length 224 [2019-10-06 23:22:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:22:38,267 INFO L225 Difference]: With dead ends: 467 [2019-10-06 23:22:38,268 INFO L226 Difference]: Without dead ends: 438 [2019-10-06 23:22:38,294 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 807 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111698 ImplicationChecksByTransitivity, 143.5s TimeCoverageRelationStatistics Valid=232779, Invalid=420893, Unknown=0, NotChecked=0, Total=653672 [2019-10-06 23:22:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-06 23:22:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 427. [2019-10-06 23:22:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-06 23:22:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 431 transitions. [2019-10-06 23:22:38,320 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 431 transitions. Word has length 224 [2019-10-06 23:22:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:22:38,321 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 431 transitions. [2019-10-06 23:22:38,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 407 states. [2019-10-06 23:22:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 431 transitions. [2019-10-06 23:22:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-06 23:22:38,329 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:22:38,329 INFO L385 BasicCegarLoop]: trace histogram [392, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:22:38,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:22:38,534 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:22:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:22:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1391142432, now seen corresponding path program 10 times [2019-10-06 23:22:38,535 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:22:38,535 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:22:38,535 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:38,535 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:22:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:34,710 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:34,710 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:34,710 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 394 conjunts are in the unsatisfiable core [2019-10-06 23:23:35,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:35,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:26:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:26:23,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:26:23,528 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:26:23,529 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:26:23,529 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:26:23,529 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:26:23,530 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:26:23,548 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:23,677 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:26:23,682 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:23,684 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:23,684 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:23,685 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_19 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:26:23,685 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_19 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:26:23,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:23,685 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_19 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:26:23,685 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:26:23,686 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:26:23,686 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:26:23,686 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:26:23,686 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:26:23,686 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:26:23,687 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:26:23,687 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:26:23,687 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:23,687 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_19 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))))) [2019-10-06 23:26:23,687 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:26:26,862 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:26,863 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [395, 395, 395, 13] total 801 [2019-10-06 23:26:26,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 801 states [2019-10-06 23:26:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 801 interpolants. [2019-10-06 23:26:26,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310905, Invalid=329895, Unknown=0, NotChecked=0, Total=640800 [2019-10-06 23:26:26,910 INFO L87 Difference]: Start difference. First operand 427 states and 431 transitions. Second operand 801 states.