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_copy9_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:34:09,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:34:09,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:34:10,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:34:10,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:34:10,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:34:10,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:34:10,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:34:10,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:34:10,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:34:10,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:34:10,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:34:10,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:34:10,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:34:10,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:34:10,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:34:10,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:34:10,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:34:10,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:34:10,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:34:10,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:34:10,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:34:10,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:34:10,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:34:10,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:34:10,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:34:10,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:34:10,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:34:10,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:34:10,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:34:10,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:34:10,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:34:10,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:34:10,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:34:10,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:34:10,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:34:10,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:34:10,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:34:10,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:34:10,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:34:10,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:34:10,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:34:10,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:34:10,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:34:10,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:34:10,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:34:10,115 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:34:10,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:34:10,116 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:34:10,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:34:10,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:34:10,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:34:10,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:34:10,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:34:10,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:34:10,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:34:10,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:34:10,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:34:10,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:34:10,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:34:10,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:34:10,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:34:10,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:34:10,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:34:10,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:34:10,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:34:10,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:34:10,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:34:10,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:34:10,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:34:10,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:34:10,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:34:10,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:34:10,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:34:10,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:34:10,462 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:34:10,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-13 21:34:10,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67439f5df/c70bd467da504b24952c3d3175bccb93/FLAG245d87c01 [2019-10-13 21:34:11,033 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:34:11,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-13 21:34:11,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67439f5df/c70bd467da504b24952c3d3175bccb93/FLAG245d87c01 [2019-10-13 21:34:11,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67439f5df/c70bd467da504b24952c3d3175bccb93 [2019-10-13 21:34:11,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:34:11,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:34:11,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:11,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:34:11,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:34:11,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b95110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11, skipping insertion in model container [2019-10-13 21:34:11,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:34:11,442 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:34:11,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:11,639 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:34:11,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:11,797 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:34:11,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11 WrapperNode [2019-10-13 21:34:11,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:11,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:34:11,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:34:11,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:34:11,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... [2019-10-13 21:34:11,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:34:11,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:34:11,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:34:11,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:34:11,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:34:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:34:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:34:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:34:11,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:34:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:34:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:34:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:34:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:34:12,570 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:34:12,570 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-13 21:34:12,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:12 BoogieIcfgContainer [2019-10-13 21:34:12,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:34:12,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:34:12,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:34:12,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:34:12,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:34:11" (1/3) ... [2019-10-13 21:34:12,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a4affc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:12, skipping insertion in model container [2019-10-13 21:34:12,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:11" (2/3) ... [2019-10-13 21:34:12,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a4affc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:12, skipping insertion in model container [2019-10-13 21:34:12,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:12" (3/3) ... [2019-10-13 21:34:12,581 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy9_ground-1.i [2019-10-13 21:34:12,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:34:12,600 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:34:12,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:34:12,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:34:12,634 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:34:12,634 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:34:12,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:34:12,635 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:34:12,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:34:12,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:34:12,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:34:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-13 21:34:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:34:12,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:12,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:12,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash 943724403, now seen corresponding path program 1 times [2019-10-13 21:34:12,680 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:12,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247056250] [2019-10-13 21:34:12,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:12,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:12,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:34:12,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247056250] [2019-10-13 21:34:12,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:12,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:34:12,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712482706] [2019-10-13 21:34:12,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:34:12,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:34:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:12,920 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-13 21:34:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:12,958 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-10-13 21:34:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:34:12,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:34:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:12,969 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:34:12,969 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 21:34:12,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 21:34:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 21:34:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:34:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-13 21:34:13,015 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 20 [2019-10-13 21:34:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:13,015 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-13 21:34:13,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:34:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-10-13 21:34:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:34:13,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:13,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:13,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1563711792, now seen corresponding path program 1 times [2019-10-13 21:34:13,018 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:13,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951793555] [2019-10-13 21:34:13,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:34:13,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951793555] [2019-10-13 21:34:13,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:13,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:34:13,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447364017] [2019-10-13 21:34:13,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:34:13,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:34:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:13,081 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 3 states. [2019-10-13 21:34:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:13,171 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2019-10-13 21:34:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:34:13,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:34:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:13,175 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:34:13,176 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:34:13,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:34:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-13 21:34:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:34:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-10-13 21:34:13,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 21 [2019-10-13 21:34:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:13,194 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-13 21:34:13,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:34:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-10-13 21:34:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:34:13,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:13,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:13,199 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash -168556700, now seen corresponding path program 1 times [2019-10-13 21:34:13,201 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:13,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594209182] [2019-10-13 21:34:13,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:34:13,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594209182] [2019-10-13 21:34:13,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758900506] [2019-10-13 21:34:13,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:13,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:34:13,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:34:13,559 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:34:13,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835370032] [2019-10-13 21:34:13,620 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:13,621 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:13,628 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:13,638 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:13,639 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:13,819 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:14,376 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:14,687 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:15,426 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:15,817 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:16,686 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:16,702 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:16,710 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:16,710 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:16,711 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (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_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,711 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,712 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (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_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,712 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:16,712 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:16,713 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,713 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:16,713 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,714 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:16,714 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:16,714 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,715 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:16,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:16,716 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,717 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,717 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:16,718 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (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_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:34:16,718 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,719 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (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_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,719 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,719 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:17,040 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:17,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:34:17,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803714793] [2019-10-13 21:34:17,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:34:17,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:34:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:34:17,047 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 17 states. [2019-10-13 21:34:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:17,726 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-10-13 21:34:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:34:17,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-13 21:34:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:17,728 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:34:17,728 INFO L226 Difference]: Without dead ends: 46 [2019-10-13 21:34:17,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:34:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-13 21:34:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-13 21:34:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:34:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-10-13 21:34:17,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 30 [2019-10-13 21:34:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:17,740 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-10-13 21:34:17,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:34:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-10-13 21:34:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:34:17,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:17,742 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:17,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:17,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -299252415, now seen corresponding path program 2 times [2019-10-13 21:34:17,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:17,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830941751] [2019-10-13 21:34:17,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:17,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:17,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:34:18,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830941751] [2019-10-13 21:34:18,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057296304] [2019-10-13 21:34:18,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:18,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:34:18,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:18,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:34:18,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:34:18,210 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:34:18,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940269101] [2019-10-13 21:34:18,246 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:18,247 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:18,249 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:18,249 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:18,249 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:18,305 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:20,308 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:20,315 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:20,318 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:20,319 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:20,319 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:20,319 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,319 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:20,320 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:20,320 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:20,320 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,320 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:20,320 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,321 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:20,321 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:20,321 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,321 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:20,321 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:20,322 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,322 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,322 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:20,322 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) [2019-10-13 21:34:20,322 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,323 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:20,323 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,323 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:20,568 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:20,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:34:20,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450293285] [2019-10-13 21:34:20,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:34:20,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:34:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:34:20,572 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 17 states. [2019-10-13 21:34:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:21,477 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2019-10-13 21:34:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:34:21,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-10-13 21:34:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:21,478 INFO L225 Difference]: With dead ends: 98 [2019-10-13 21:34:21,479 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 21:34:21,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:34:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 21:34:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2019-10-13 21:34:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 21:34:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-10-13 21:34:21,496 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 33 [2019-10-13 21:34:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:21,497 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-10-13 21:34:21,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:34:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-10-13 21:34:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:34:21,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:21,501 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:21,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:21,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -728873293, now seen corresponding path program 3 times [2019-10-13 21:34:21,703 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:21,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283280409] [2019-10-13 21:34:21,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 21:34:21,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283280409] [2019-10-13 21:34:21,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513168005] [2019-10-13 21:34:21,855 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:21,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:21,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:21,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:34:21,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 21:34:22,039 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 21:34:22,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496723770] [2019-10-13 21:34:22,110 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:22,111 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:22,111 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:22,111 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:22,112 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:22,129 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:23,972 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:23,979 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:23,983 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:23,984 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:23,984 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:23,984 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,984 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(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_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,985 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:23,986 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,986 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:23,986 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:23,986 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:23,986 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,987 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,987 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:23,987 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) [2019-10-13 21:34:23,987 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,987 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(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_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:23,988 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:23,988 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:24,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:24,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 27 [2019-10-13 21:34:24,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637766314] [2019-10-13 21:34:24,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 21:34:24,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 21:34:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:34:24,305 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 27 states. [2019-10-13 21:34:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:25,611 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2019-10-13 21:34:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:34:25,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2019-10-13 21:34:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:25,618 INFO L225 Difference]: With dead ends: 142 [2019-10-13 21:34:25,618 INFO L226 Difference]: Without dead ends: 88 [2019-10-13 21:34:25,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=2003, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:34:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-13 21:34:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2019-10-13 21:34:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-13 21:34:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-10-13 21:34:25,632 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 60 [2019-10-13 21:34:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:25,633 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-10-13 21:34:25,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 21:34:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-10-13 21:34:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 21:34:25,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:25,634 INFO L380 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:25,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:25,839 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1290344095, now seen corresponding path program 4 times [2019-10-13 21:34:25,840 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:25,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134052654] [2019-10-13 21:34:25,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:25,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:34:26,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134052654] [2019-10-13 21:34:26,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236218053] [2019-10-13 21:34:26,040 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:26,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:34:26,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:34:26,213 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:34:26,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810739010] [2019-10-13 21:34:26,383 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:26,383 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:26,384 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:26,384 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:26,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:26,405 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:28,198 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:28,240 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:28,249 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:28,253 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:28,253 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:28,254 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~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|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:28,254 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,254 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~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|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:28,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:28,254 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:28,255 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,255 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:28,255 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,255 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:28,255 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,256 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:28,256 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:28,256 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:28,257 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,257 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,257 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:28,257 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~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|))))) [2019-10-13 21:34:28,257 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,258 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~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|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:28,258 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,258 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:28,583 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:28,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:34:28,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68586771] [2019-10-13 21:34:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:34:28,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:34:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:34:28,587 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 35 states. [2019-10-13 21:34:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:29,853 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2019-10-13 21:34:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:34:29,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2019-10-13 21:34:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:29,857 INFO L225 Difference]: With dead ends: 163 [2019-10-13 21:34:29,857 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 21:34:29,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:34:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 21:34:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-13 21:34:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 21:34:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2019-10-13 21:34:29,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 75 [2019-10-13 21:34:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:29,872 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2019-10-13 21:34:29,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:34:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2019-10-13 21:34:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:34:29,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:29,874 INFO L380 BasicCegarLoop]: trace histogram [22, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:30,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:30,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2108998751, now seen corresponding path program 5 times [2019-10-13 21:34:30,081 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:30,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563674521] [2019-10-13 21:34:30,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:30,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:30,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 21:34:30,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563674521] [2019-10-13 21:34:30,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144077120] [2019-10-13 21:34:30,522 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:33,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:34:33,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:33,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-13 21:34:33,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-10-13 21:34:33,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-13 21:34:33,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229968883] [2019-10-13 21:34:33,971 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:33,972 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:33,972 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:33,972 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:33,972 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:33,989 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:35,500 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:35,712 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:35,971 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:36,026 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:36,036 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:36,042 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:36,042 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:36,042 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| 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_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~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-13 21:34:36,043 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,043 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| 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_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:36,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:36,043 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:36,044 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,044 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:36,044 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,046 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:36,046 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,046 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:34:36,046 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:36,046 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:36,047 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,047 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,047 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:36,047 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| 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_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~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-13 21:34:36,047 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,048 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| 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_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~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_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:36,048 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,048 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:36,509 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:36,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 8, 11] total 49 [2019-10-13 21:34:36,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555591291] [2019-10-13 21:34:36,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-13 21:34:36,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:36,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-13 21:34:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1894, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:34:36,512 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 49 states. [2019-10-13 21:34:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:39,733 INFO L93 Difference]: Finished difference Result 227 states and 310 transitions. [2019-10-13 21:34:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:34:39,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 87 [2019-10-13 21:34:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:39,736 INFO L225 Difference]: With dead ends: 227 [2019-10-13 21:34:39,736 INFO L226 Difference]: Without dead ends: 164 [2019-10-13 21:34:39,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1433, Invalid=7123, Unknown=0, NotChecked=0, Total=8556 [2019-10-13 21:34:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-13 21:34:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2019-10-13 21:34:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-13 21:34:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-10-13 21:34:39,759 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-10-13 21:34:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:39,760 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-10-13 21:34:39,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-13 21:34:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-10-13 21:34:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:34:39,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:39,763 INFO L380 BasicCegarLoop]: trace histogram [23, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:39,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:39,970 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash 803430864, now seen corresponding path program 6 times [2019-10-13 21:34:39,971 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:39,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743557393] [2019-10-13 21:34:39,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:39,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:39,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-10-13 21:34:40,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743557393] [2019-10-13 21:34:40,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604355439] [2019-10-13 21:34:40,473 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:40,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:40,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:40,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:34:40,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-10-13 21:34:40,797 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-10-13 21:34:41,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703252295] [2019-10-13 21:34:41,523 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:34:41,523 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:41,524 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:41,524 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:41,524 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:41,540 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:42,755 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:43,392 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:43,398 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:43,401 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:43,401 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~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| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~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| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-13 21:34:43,402 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,403 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(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-13 21:34:43,403 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,403 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:43,403 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,403 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* main_~x~0 4) |main_~#a0~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:43,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~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| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:34:43,405 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,405 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~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| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:43,405 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,405 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:43,987 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:43,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:34:43,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71017820] [2019-10-13 21:34:43,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:34:43,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:43,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:34:43,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:34:43,993 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 61 states. [2019-10-13 21:34:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:46,800 INFO L93 Difference]: Finished difference Result 315 states and 359 transitions. [2019-10-13 21:34:46,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:34:46,801 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 151 [2019-10-13 21:34:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:46,802 INFO L225 Difference]: With dead ends: 315 [2019-10-13 21:34:46,802 INFO L226 Difference]: Without dead ends: 189 [2019-10-13 21:34:46,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:34:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-13 21:34:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2019-10-13 21:34:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-13 21:34:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2019-10-13 21:34:46,843 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 151 [2019-10-13 21:34:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:46,843 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-10-13 21:34:46,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:34:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2019-10-13 21:34:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-13 21:34:46,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:46,847 INFO L380 BasicCegarLoop]: trace histogram [48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:47,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:47,052 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 357844595, now seen corresponding path program 7 times [2019-10-13 21:34:47,053 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:47,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111776780] [2019-10-13 21:34:47,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:47,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:47,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-10-13 21:34:48,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111776780] [2019-10-13 21:34:48,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825759650] [2019-10-13 21:34:48,232 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true