java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:30:35,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:30:35,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:30:35,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:30:35,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:30:35,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:30:35,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:30:35,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:30:35,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:30:35,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:30:35,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:30:35,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:30:35,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:30:35,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:30:35,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:30:35,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:30:35,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:30:35,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:30:35,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:30:35,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:30:35,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:30:35,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:30:35,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:30:35,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:30:35,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:30:35,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:30:35,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:30:35,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:30:35,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:30:35,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:30:35,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:30:35,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:30:35,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:30:35,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:30:35,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:30:35,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:30:35,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:30:35,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:30:35,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:30:35,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:30:35,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:30:35,896 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:30:35,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:30:35,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:30:35,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:30:35,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:30:35,915 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:30:35,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:30:35,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:30:35,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:30:35,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:30:35,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:30:35,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:30:35,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:30:35,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:30:35,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:30:35,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:30:35,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:30:35,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:35,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:30:35,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:30:35,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:30:35,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:30:35,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:30:35,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:30:35,921 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:30:36,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:30:36,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:30:36,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:30:36,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:30:36,209 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:30:36,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-2.i [2019-10-06 23:30:36,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab325b1/e01660e8e07b45e68214b172bfe2dc70/FLAGb17347f77 [2019-10-06 23:30:36,713 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:30:36,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_ground-2.i [2019-10-06 23:30:36,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab325b1/e01660e8e07b45e68214b172bfe2dc70/FLAGb17347f77 [2019-10-06 23:30:37,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab325b1/e01660e8e07b45e68214b172bfe2dc70 [2019-10-06 23:30:37,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:30:37,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:30:37,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:37,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:30:37,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:30:37,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37, skipping insertion in model container [2019-10-06 23:30:37,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,166 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:30:37,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:30:37,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:37,346 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:30:37,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:37,386 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:30:37,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37 WrapperNode [2019-10-06 23:30:37,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:37,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:30:37,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:30:37,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:30:37,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (1/1) ... [2019-10-06 23:30:37,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:30:37,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:30:37,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:30:37,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:30:37,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (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:30:37,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:30:37,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:30:37,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:30:37,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:30:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:30:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:30:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:30:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:30:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:30:37,945 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:30:37,945 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-06 23:30:37,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:37 BoogieIcfgContainer [2019-10-06 23:30:37,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:30:37,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:30:37,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:30:37,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:30:37,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:30:37" (1/3) ... [2019-10-06 23:30:37,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54148de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:37, skipping insertion in model container [2019-10-06 23:30:37,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:37" (2/3) ... [2019-10-06 23:30:37,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54148de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:37, skipping insertion in model container [2019-10-06 23:30:37,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:37" (3/3) ... [2019-10-06 23:30:37,953 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy2_ground-2.i [2019-10-06 23:30:37,962 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:30:37,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:30:37,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:30:38,002 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:30:38,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:30:38,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:30:38,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:30:38,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:30:38,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:30:38,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:30:38,003 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:30:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-06 23:30:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:30:38,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:38,024 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:38,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1272573714, now seen corresponding path program 1 times [2019-10-06 23:30:38,038 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:38,038 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,038 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,180 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:30:38,180 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,181 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:38,181 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:38,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:38,198 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-06 23:30:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:38,237 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-06 23:30:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:38,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:30:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:38,247 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:30:38,248 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:30:38,251 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:30:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:30:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:30:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:30:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-06 23:30:38,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-06 23:30:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:38,296 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-06 23:30:38,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-06 23:30:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:30:38,298 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:38,298 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:38,298 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1861910933, now seen corresponding path program 1 times [2019-10-06 23:30:38,300 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:38,301 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,351 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:30:38,351 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,352 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:38,352 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:38,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:38,355 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-06 23:30:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:38,383 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-06 23:30:38,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:38,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:30:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:38,385 INFO L225 Difference]: With dead ends: 30 [2019-10-06 23:30:38,385 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:30:38,386 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:30:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:30:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:30:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:30:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-06 23:30:38,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-06 23:30:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:38,392 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-06 23:30:38,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-06 23:30:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:30:38,394 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:38,394 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:30:38,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 728822389, now seen corresponding path program 1 times [2019-10-06 23:30:38,396 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:38,397 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,481 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:30:38,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:38,482 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:30:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:38,595 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:30:38,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:38,632 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:30:38,633 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:38,655 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:38,655 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:38,661 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:38,669 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:38,669 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:38,817 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:39,203 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:30:39,609 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:39,632 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:39,638 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:39,638 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:39,639 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:39,639 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~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:30:39,639 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:39,640 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:39,640 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:30:39,641 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:30:39,641 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:39,642 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:39,642 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:39,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:39,642 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:30:39,643 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~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:30:39,643 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:39,643 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:39,978 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:39,978 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:30:39,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:30:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:30:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:30:39,981 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 18 states. [2019-10-06 23:30:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:40,626 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-06 23:30:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:30:40,628 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-06 23:30:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:40,629 INFO L225 Difference]: With dead ends: 47 [2019-10-06 23:30:40,630 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:30:40,632 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:30:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:30:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-06 23:30:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:30:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-06 23:30:40,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-06 23:30:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:40,645 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-06 23:30:40,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:30:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-06 23:30:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:30:40,647 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:40,647 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:40,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:40,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:40,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1554625518, now seen corresponding path program 2 times [2019-10-06 23:30:40,851 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:40,851 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:30:40,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:40,964 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:30:41,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:30:41,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:41,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:30:41,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-06 23:30:41,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-06 23:30:41,153 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:41,157 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:41,157 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:41,158 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:41,158 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:41,159 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:41,199 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:41,783 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:41,798 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:41,804 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:41,804 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:41,804 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:41,805 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __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:30:41,805 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:41,805 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:41,805 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:30:41,806 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:30:41,806 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:41,807 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:41,811 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:41,811 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:41,811 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:30:41,812 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __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:30:41,812 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:41,812 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:42,129 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:42,129 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:30:42,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:30:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:30:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:30:42,132 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 23 states. [2019-10-06 23:30:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:42,892 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-06 23:30:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:30:42,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-10-06 23:30:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:42,894 INFO L225 Difference]: With dead ends: 58 [2019-10-06 23:30:42,894 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:30:42,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:30:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:30:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-06 23:30:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:30:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-06 23:30:42,904 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2019-10-06 23:30:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:42,905 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-06 23:30:42,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:30:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-06 23:30:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:30:42,906 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:42,906 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:43,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:43,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -149803285, now seen corresponding path program 3 times [2019-10-06 23:30:43,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:43,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:43,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:43,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-06 23:30:43,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:43,261 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:43,261 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:30:43,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:43,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:43,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:30:43,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:43,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:43,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:43,520 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:43,520 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:43,520 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:43,521 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:43,521 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:43,547 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:44,013 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:44,022 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:44,025 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:44,025 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:44,025 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:44,026 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:44,026 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:44,026 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:44,026 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:30:44,027 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:30:44,027 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:44,027 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:44,027 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:44,028 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:44,028 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) [2019-10-06 23:30:44,028 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:44,028 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:44,028 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:44,380 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:44,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-06 23:30:44,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:30:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:30:44,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:30:44,383 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 31 states. [2019-10-06 23:30:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:45,574 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-10-06 23:30:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-06 23:30:45,576 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-10-06 23:30:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:45,577 INFO L225 Difference]: With dead ends: 75 [2019-10-06 23:30:45,577 INFO L226 Difference]: Without dead ends: 52 [2019-10-06 23:30:45,580 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:30:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-06 23:30:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-06 23:30:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-06 23:30:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-06 23:30:45,588 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 30 [2019-10-06 23:30:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:45,588 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-06 23:30:45,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:30:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-06 23:30:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:30:45,590 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:45,590 INFO L385 BasicCegarLoop]: trace histogram [12, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:45,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:45,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373768, now seen corresponding path program 4 times [2019-10-06 23:30:45,795 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:45,795 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:45,795 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:45,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:30:45,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:45,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:45,935 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:30:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:46,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:30:46,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-06 23:30:46,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-06 23:30:46,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:46,478 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:46,478 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:46,479 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:46,479 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:46,479 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:46,510 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:46,976 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:46,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:46,990 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:46,991 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:46,991 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:46,991 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:46,991 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:46,991 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:46,992 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:30:46,992 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:30:46,992 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:46,992 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:46,992 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:46,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:46,993 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) [2019-10-06 23:30:46,993 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:46,993 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:46,994 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:47,366 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:47,366 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-06 23:30:47,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-06 23:30:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-06 23:30:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:30:47,369 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 46 states. [2019-10-06 23:30:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:49,169 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-10-06 23:30:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-06 23:30:49,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 39 [2019-10-06 23:30:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:49,171 INFO L225 Difference]: With dead ends: 93 [2019-10-06 23:30:49,171 INFO L226 Difference]: Without dead ends: 68 [2019-10-06 23:30:49,173 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2019-10-06 23:30:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-06 23:30:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-06 23:30:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:30:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-10-06 23:30:49,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 39 [2019-10-06 23:30:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:49,183 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-10-06 23:30:49,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-06 23:30:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-10-06 23:30:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:30:49,185 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:49,185 INFO L385 BasicCegarLoop]: trace histogram [26, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:49,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:49,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -738862322, now seen corresponding path program 5 times [2019-10-06 23:30:49,390 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:49,390 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:49,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:49,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-06 23:30:49,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:49,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:49,853 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:30:50,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:30:50,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:50,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:30:50,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-06 23:30:50,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-06 23:30:50,790 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:50,793 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:50,793 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:50,794 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:50,794 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:50,794 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:50,821 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:51,088 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:30:51,332 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:51,343 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:51,346 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:51,346 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:51,346 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:51,347 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(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_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:51,347 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:51,347 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:51,347 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:30:51,347 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:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-06 23:30:51,348 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(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_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:51,349 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:51,349 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:51,759 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:51,759 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11, 11, 11] total 57 [2019-10-06 23:30:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-06 23:30:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-06 23:30:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=2568, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:30:51,764 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 57 states. [2019-10-06 23:30:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:54,396 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2019-10-06 23:30:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-06 23:30:54,397 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 55 [2019-10-06 23:30:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:54,399 INFO L225 Difference]: With dead ends: 116 [2019-10-06 23:30:54,399 INFO L226 Difference]: Without dead ends: 89 [2019-10-06 23:30:54,403 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1902, Invalid=9870, Unknown=0, NotChecked=0, Total=11772 [2019-10-06 23:30:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-06 23:30:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-10-06 23:30:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-06 23:30:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-06 23:30:54,416 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 55 [2019-10-06 23:30:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:54,416 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-06 23:30:54,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-06 23:30:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-06 23:30:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-06 23:30:54,419 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:54,419 INFO L385 BasicCegarLoop]: trace histogram [27, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:54,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:54,623 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1722620277, now seen corresponding path program 6 times [2019-10-06 23:30:54,624 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:54,624 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:54,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:54,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-10-06 23:30:54,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:54,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:54,882 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:30:55,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:55,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:55,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:30:55,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-06 23:30:55,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-06 23:30:56,703 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:56,704 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:56,704 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:56,704 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:56,704 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:56,705 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:56,726 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:57,152 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:57,157 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:57,159 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:57,159 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:57,160 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:57,160 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:30:57,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:57,160 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:57,160 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:30:57,160 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:30:57,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:57,161 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:57,614 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:57,615 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 30, 11] total 87 [2019-10-06 23:30:57,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-06 23:30:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-06 23:30:57,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2019-10-06 23:30:57,620 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 87 states. [2019-10-06 23:31:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:02,345 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2019-10-06 23:31:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-06 23:31:02,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 76 [2019-10-06 23:31:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:02,349 INFO L225 Difference]: With dead ends: 167 [2019-10-06 23:31:02,349 INFO L226 Difference]: Without dead ends: 120 [2019-10-06 23:31:02,355 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6686 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5705, Invalid=22687, Unknown=0, NotChecked=0, Total=28392 [2019-10-06 23:31:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-06 23:31:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-10-06 23:31:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-06 23:31:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-10-06 23:31:02,369 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 76 [2019-10-06 23:31:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:02,370 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-10-06 23:31:02,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-06 23:31:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-10-06 23:31:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-06 23:31:02,371 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:02,372 INFO L385 BasicCegarLoop]: trace histogram [56, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:02,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:02,576 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash 591761656, now seen corresponding path program 7 times [2019-10-06 23:31:02,577 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:02,577 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:02,577 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:02,577 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-06 23:31:03,970 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,970 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:03,970 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:31:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:31:04,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-06 23:31:04,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-06 23:31:07,780 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:07,781 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:31:07,781 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:07,781 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:07,782 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:07,782 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:07,799 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:08,215 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:08,222 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:08,224 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:08,225 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:08,225 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:08,225 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __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:31:08,225 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:08,225 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:08,226 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:31:08,226 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:31:08,226 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:31:08,226 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:31:08,226 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:08,226 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:08,227 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) [2019-10-06 23:31:08,227 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __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:31:08,227 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:08,227 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:08,741 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:08,741 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:31:08,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:31:08,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:31:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:31:08,746 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 127 states. [2019-10-06 23:31:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:18,048 INFO L93 Difference]: Finished difference Result 227 states and 290 transitions. [2019-10-06 23:31:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:31:18,049 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 107 [2019-10-06 23:31:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:18,051 INFO L225 Difference]: With dead ends: 227 [2019-10-06 23:31:18,052 INFO L226 Difference]: Without dead ends: 178 [2019-10-06 23:31:18,056 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:31:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-06 23:31:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2019-10-06 23:31:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-06 23:31:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2019-10-06 23:31:18,078 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 107 [2019-10-06 23:31:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:18,078 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2019-10-06 23:31:18,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:31:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-10-06 23:31:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-06 23:31:18,081 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:18,081 INFO L385 BasicCegarLoop]: trace histogram [114, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:18,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:18,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1492070888, now seen corresponding path program 8 times [2019-10-06 23:31:18,287 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:18,287 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:18,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:18,288 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6935 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-06 23:31:23,285 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:23,285 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:23,285 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:32:47,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-06 23:32:47,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:32:47,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-06 23:32:47,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:32:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6935 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 6745 trivial. 0 not checked. [2019-10-06 23:32:48,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6935 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 6745 trivial. 0 not checked. [2019-10-06 23:32:49,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:49,953 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:32:49,953 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:49,954 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:49,954 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:49,954 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:49,970 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:50,373 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:32:50,410 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:50,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:50,419 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:50,419 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:50,419 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:50,420 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:32:50,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:50,420 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:50,420 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:32:50,420 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:32:50,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:32:50,421 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:50,422 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:51,351 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:51,351 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 22, 22, 11] total 167 [2019-10-06 23:32:51,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-10-06 23:32:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-10-06 23:32:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7675, Invalid=20047, Unknown=0, NotChecked=0, Total=27722 [2019-10-06 23:32:51,356 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand 167 states. [2019-10-06 23:33:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:07,462 INFO L93 Difference]: Finished difference Result 270 states and 318 transitions. [2019-10-06 23:33:07,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-10-06 23:33:07,463 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 165 [2019-10-06 23:33:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:07,465 INFO L225 Difference]: With dead ends: 270 [2019-10-06 23:33:07,466 INFO L226 Difference]: Without dead ends: 221 [2019-10-06 23:33:07,469 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22413 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=23099, Invalid=84813, Unknown=0, NotChecked=0, Total=107912 [2019-10-06 23:33:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-06 23:33:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 212. [2019-10-06 23:33:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-06 23:33:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2019-10-06 23:33:07,493 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 165 [2019-10-06 23:33:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:07,493 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2019-10-06 23:33:07,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-10-06 23:33:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2019-10-06 23:33:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-06 23:33:07,496 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:07,497 INFO L385 BasicCegarLoop]: trace histogram [115, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:07,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:07,698 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:07,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1430298421, now seen corresponding path program 9 times [2019-10-06 23:33:07,699 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:07,699 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:07,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:07,700 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8310 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:33:12,713 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:12,713 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:12,713 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:33:12,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:33:12,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:13,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:33:13,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8310 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:33:13,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8310 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:33:27,271 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:27,272 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:33:27,272 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:27,273 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:27,273 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:27,273 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:27,290 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:27,714 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:27,722 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:27,726 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:27,726 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:27,726 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:27,727 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:27,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:27,727 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:27,728 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:33:27,728 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:33:27,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:33:27,728 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:33:27,729 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:27,729 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:27,729 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) [2019-10-06 23:33:27,729 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:27,729 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:27,730 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:28,549 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:28,549 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:33:28,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:33:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:33:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:33:28,555 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand 245 states. [2019-10-06 23:34:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:34:01,179 INFO L93 Difference]: Finished difference Result 429 states and 551 transitions. [2019-10-06 23:34:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:34:01,179 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 208 [2019-10-06 23:34:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:34:01,182 INFO L225 Difference]: With dead ends: 429 [2019-10-06 23:34:01,182 INFO L226 Difference]: Without dead ends: 338 [2019-10-06 23:34:01,187 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:34:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-06 23:34:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2019-10-06 23:34:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-06 23:34:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 332 transitions. [2019-10-06 23:34:01,211 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 332 transitions. Word has length 208 [2019-10-06 23:34:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:34:01,212 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 332 transitions. [2019-10-06 23:34:01,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:34:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 332 transitions. [2019-10-06 23:34:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-06 23:34:01,217 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:34:01,217 INFO L385 BasicCegarLoop]: trace histogram [232, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:34:01,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:01,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:34:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:34:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2128084882, now seen corresponding path program 10 times [2019-10-06 23:34:01,461 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:34:01,462 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:01,462 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:01,462 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:34:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 28668 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:34:20,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:20,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:34:20,590 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:34:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:21,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:34:21,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:34:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28668 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:34:21,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:35:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28668 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-06 23:35:18,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:35:18,838 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:35:18,838 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:35:18,838 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:35:18,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:35:18,839 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:35:18,889 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:35:19,322 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:35:19,336 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:35:19,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:35:19,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:35:19,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:19,339 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:19,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:35:19,339 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:19,339 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:35:19,340 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:35:19,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:35:19,340 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:35:19,340 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:35:19,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:35:19,340 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:35:19,341 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:19,341 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:19,341 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem7|) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:35:20,776 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:35:20,777 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:35:20,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:35:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:35:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:35:20,793 INFO L87 Difference]: Start difference. First operand 329 states and 332 transitions. Second operand 479 states. [2019-10-06 23:37:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:37:27,317 INFO L93 Difference]: Finished difference Result 663 states and 902 transitions. [2019-10-06 23:37:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:37:27,318 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 325 [2019-10-06 23:37:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:37:27,322 INFO L225 Difference]: With dead ends: 663 [2019-10-06 23:37:27,322 INFO L226 Difference]: Without dead ends: 572 [2019-10-06 23:37:27,338 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1683 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 193.3s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:37:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-06 23:37:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 563. [2019-10-06 23:37:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-06 23:37:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 566 transitions. [2019-10-06 23:37:27,363 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 566 transitions. Word has length 325 [2019-10-06 23:37:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:37:27,363 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 566 transitions. [2019-10-06 23:37:27,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:37:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 566 transitions. [2019-10-06 23:37:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-10-06 23:37:27,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:37:27,374 INFO L385 BasicCegarLoop]: trace histogram [466, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:37:27,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:27,580 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:37:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:37:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1110414478, now seen corresponding path program 11 times [2019-10-06 23:37:27,581 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:37:27,581 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:27,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:27,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:37:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 110451 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 109631 trivial. 0 not checked. [2019-10-06 23:37:30,695 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:30,696 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:30,696 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true