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/loops/vogal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:47:37,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:47:37,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:47:37,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:47:37,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:47:37,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:47:37,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:47:37,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:47:37,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:47:37,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:47:37,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:47:37,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:47:37,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:47:37,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:47:37,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:47:37,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:47:37,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:47:37,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:47:37,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:47:37,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:47:37,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:47:37,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:47:37,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:47:37,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:47:37,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:47:37,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:47:37,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:47:37,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:47:37,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:47:37,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:47:37,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:47:37,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:47:37,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:47:37,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:47:37,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:47:37,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:47:37,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:47:37,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:47:37,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:47:37,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:47:37,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:47:37,891 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-07 13:47:37,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:47:37,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:47:37,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:47:37,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:47:37,906 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:47:37,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:47:37,907 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:47:37,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:47:37,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:47:37,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:47:37,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:47:37,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:47:37,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:47:37,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:47:37,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:47:37,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:47:37,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:47:37,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:47:37,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:47:37,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:47:37,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:47:37,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:47:37,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:47:37,911 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-07 13:47:38,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:47:38,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:47:38,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:47:38,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:47:38,190 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:47:38,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-2.i [2019-10-07 13:47:38,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df4407b7/89f08ee18f894123abab71663c68d5ab/FLAGa077df829 [2019-10-07 13:47:38,721 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:47:38,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i [2019-10-07 13:47:38,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df4407b7/89f08ee18f894123abab71663c68d5ab/FLAGa077df829 [2019-10-07 13:47:39,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df4407b7/89f08ee18f894123abab71663c68d5ab [2019-10-07 13:47:39,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:47:39,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:47:39,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:47:39,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:47:39,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:47:39,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781bead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39, skipping insertion in model container [2019-10-07 13:47:39,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:47:39,127 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:47:39,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:47:39,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:47:39,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:47:39,397 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:47:39,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39 WrapperNode [2019-10-07 13:47:39,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:47:39,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:47:39,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:47:39,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:47:39,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (1/1) ... [2019-10-07 13:47:39,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:47:39,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:47:39,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:47:39,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:47:39,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (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-07 13:47:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:47:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:47:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:47:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:47:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:47:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:47:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:47:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:47:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:47:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:47:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:47:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:47:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:47:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:47:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:47:40,049 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:47:40,049 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 13:47:40,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:47:40 BoogieIcfgContainer [2019-10-07 13:47:40,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:47:40,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:47:40,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:47:40,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:47:40,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:47:39" (1/3) ... [2019-10-07 13:47:40,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c9d17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:47:40, skipping insertion in model container [2019-10-07 13:47:40,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:39" (2/3) ... [2019-10-07 13:47:40,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c9d17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:47:40, skipping insertion in model container [2019-10-07 13:47:40,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:47:40" (3/3) ... [2019-10-07 13:47:40,059 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2019-10-07 13:47:40,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:47:40,076 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:47:40,087 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:47:40,112 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:47:40,112 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:47:40,112 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:47:40,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:47:40,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:47:40,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:47:40,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:47:40,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:47:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-07 13:47:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:47:40,137 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:40,138 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:40,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:40,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1300943193, now seen corresponding path program 1 times [2019-10-07 13:47:40,152 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:40,152 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,290 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-07 13:47:40,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,291 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:40,292 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:47:40,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:47:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:47:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:47:40,313 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-07 13:47:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:40,338 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-10-07 13:47:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:47:40,339 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-07 13:47:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:40,347 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:47:40,348 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 13:47:40,351 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:47:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 13:47:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 13:47:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 13:47:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-07 13:47:40,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2019-10-07 13:47:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:40,383 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-07 13:47:40,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:47:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-10-07 13:47:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:47:40,384 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:40,385 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:40,385 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1331812321, now seen corresponding path program 1 times [2019-10-07 13:47:40,386 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:40,386 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,503 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-07 13:47:40,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,505 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:40,505 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:47:40,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:47:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:47:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:47:40,507 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2019-10-07 13:47:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:40,576 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-07 13:47:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:47:40,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-07 13:47:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:40,580 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:47:40,580 INFO L226 Difference]: Without dead ends: 26 [2019-10-07 13:47:40,581 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:47:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-07 13:47:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-10-07 13:47:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 13:47:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-07 13:47:40,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2019-10-07 13:47:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:40,588 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-07 13:47:40,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:47:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-07 13:47:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:47:40,590 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:40,590 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:40,590 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1442987554, now seen corresponding path program 1 times [2019-10-07 13:47:40,591 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:40,591 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:47:40,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:47:40,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:40,878 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-07 13:47:40,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:40,951 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-07 13:47:40,951 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:47:40,951 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-10-07 13:47:40,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:47:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:47:40,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:47:40,953 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 10 states. [2019-10-07 13:47:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:41,049 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-10-07 13:47:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:47:41,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-07 13:47:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:41,052 INFO L225 Difference]: With dead ends: 34 [2019-10-07 13:47:41,052 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:47:41,053 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:47:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:47:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-10-07 13:47:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:47:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-07 13:47:41,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2019-10-07 13:47:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:41,059 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-07 13:47:41,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:47:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-10-07 13:47:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:47:41,060 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:41,060 INFO L385 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-07 13:47:41,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:41,270 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash -68639491, now seen corresponding path program 1 times [2019-10-07 13:47:41,271 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:41,272 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,272 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,272 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:47:41,367 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,367 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 13:47:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:47:41,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:47:41,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:47:41,482 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:47:41,482 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-10-07 13:47:41,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:47:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:47:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:47:41,483 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2019-10-07 13:47:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:41,554 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2019-10-07 13:47:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:47:41,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-07 13:47:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:41,555 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:47:41,555 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 13:47:41,556 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:47:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 13:47:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-10-07 13:47:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:47:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-10-07 13:47:41,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 20 [2019-10-07 13:47:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:41,563 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-07 13:47:41,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:47:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-10-07 13:47:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:47:41,564 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:41,564 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:41,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:41,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1439104631, now seen corresponding path program 1 times [2019-10-07 13:47:41,774 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:41,774 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,774 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:47:41,893 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,893 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 13:47:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 13:47:41,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:42,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-07 13:47:42,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:42,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-07 13:47:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:47:42,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:42,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:47:42,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-07 13:47:42,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:42,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-07 13:47:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:42,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,216 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-07 13:47:42,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:7 [2019-10-07 13:47:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:47:42,251 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:47:42,251 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-07 13:47:42,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:47:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:47:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:47:42,252 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2019-10-07 13:47:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:42,429 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-10-07 13:47:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:47:42,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-07 13:47:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:42,432 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:47:42,433 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:47:42,433 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:47:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:47:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-07 13:47:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:47:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-07 13:47:42,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2019-10-07 13:47:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:42,447 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-07 13:47:42,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:47:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-07 13:47:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:47:42,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:42,448 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:42,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:42,653 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1784666200, now seen corresponding path program 1 times [2019-10-07 13:47:42,654 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:42,654 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:42,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:42,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:47:42,791 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:42,791 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order 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-07 13:47:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:42,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 13:47:42,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:42,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-07 13:47:42,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:42,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:47:42,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-07 13:47:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:47:42,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:43,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:43,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-07 13:47:43,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:47:43,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:43,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:47:43,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-07 13:47:43,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:43,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:47:43,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 13:47:43,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:43,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-10-07 13:47:43,067 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:43,076 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-07 13:47:43,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:47:43,077 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:7 [2019-10-07 13:47:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:47:43,097 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:47:43,121 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 13:47:43,122 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:47:43,128 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:47:43,135 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:47:43,136 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:47:43,230 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:47:43,441 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:47:43,786 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:47:43,806 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:47:43,812 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:47:43,812 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:47:43,812 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 455#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:47:43,812 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 101#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,813 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 432#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-07 13:47:43,813 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 372#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,813 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 441#(and (exists ((v_prenex_4 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:43,813 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-07 13:47:43,814 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 364#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,814 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-07 13:47:43,814 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-07 13:47:43,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 460#(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-07 13:47:43,815 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:47:43,815 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 446#(and (exists ((v_prenex_4 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (<= __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-07 13:47:43,816 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 436#(exists ((v_prenex_4 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) [2019-10-07 13:47:43,816 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 106#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,817 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 427#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-07 13:47:43,820 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 451#(and (exists ((v_prenex_4 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (<= __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-07 13:47:43,824 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~n_caracter~0) [2019-10-07 13:47:43,824 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 385#true [2019-10-07 13:47:44,583 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:47:44,583 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 7, 15] total 29 [2019-10-07 13:47:44,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 13:47:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 13:47:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:47:44,587 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 29 states. [2019-10-07 13:47:45,971 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-07 13:47:46,573 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-07 13:47:46,820 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-07 13:47:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:47,155 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-10-07 13:47:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 13:47:47,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 22 [2019-10-07 13:47:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:47,157 INFO L225 Difference]: With dead ends: 50 [2019-10-07 13:47:47,157 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:47:47,160 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 13:47:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:47:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-07 13:47:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:47:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-07 13:47:47,168 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2019-10-07 13:47:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:47,169 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-07 13:47:47,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 13:47:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-07 13:47:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:47:47,170 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:47,170 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:47,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:47,374 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:47,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1863962312, now seen corresponding path program 1 times [2019-10-07 13:47:47,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:47,374 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:47,374 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:47,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:47:47,521 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:47,521 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 13:47:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:47,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 13:47:47,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:47:47,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:47:47,701 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:47:47,703 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 13:47:47,703 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:47:47,704 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:47:47,704 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:47:47,704 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:47:47,740 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:47:47,898 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:47:48,444 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:47:48,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:47:48,456 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:47:48,457 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:47:48,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 773#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:47:48,457 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 708#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-07 13:47:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 609#(<= 0 main_~j~0) [2019-10-07 13:47:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 759#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 434#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-07 13:47:48,460 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 426#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:48,461 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-07 13:47:48,461 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-07 13:47:48,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 778#(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-07 13:47:48,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:47:48,462 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 764#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (<= __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-07 13:47:48,462 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 754#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) [2019-10-07 13:47:48,462 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:48,462 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 661#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-07 13:47:48,463 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 769#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (<= __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-07 13:47:48,463 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-07 13:47:48,463 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 750#true [2019-10-07 13:47:49,029 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:47:49,030 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6, 16] total 26 [2019-10-07 13:47:49,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 13:47:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 13:47:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:47:49,031 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 26 states. [2019-10-07 13:47:50,571 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 13:47:51,658 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 13:47:51,814 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-07 13:47:53,011 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-07 13:47:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:54,068 INFO L93 Difference]: Finished difference Result 100 states and 136 transitions. [2019-10-07 13:47:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-07 13:47:54,069 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-10-07 13:47:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:54,071 INFO L225 Difference]: With dead ends: 100 [2019-10-07 13:47:54,071 INFO L226 Difference]: Without dead ends: 78 [2019-10-07 13:47:54,074 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=868, Invalid=4244, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 13:47:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-07 13:47:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 34. [2019-10-07 13:47:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 13:47:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-07 13:47:54,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2019-10-07 13:47:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:54,088 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-07 13:47:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 13:47:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-07 13:47:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:47:54,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:54,090 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:54,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:54,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -988618494, now seen corresponding path program 2 times [2019-10-07 13:47:54,296 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:54,296 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:54,296 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:54,296 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 13:47:54,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:54,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:54,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 13:47:54,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:47:54,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:47:54,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 13:47:54,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 13:47:54,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 13:47:54,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:47:54,653 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 13:47:54,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:47:54,655 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:47:54,655 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:47:54,656 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:47:54,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:47:54,783 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:47:55,191 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:47:55,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:47:55,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:47:55,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:47:55,202 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 712#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:47:55,202 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 647#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 561#(<= 0 main_~j~0) [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 698#(and (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 386#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-07 13:47:55,203 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 378#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:55,204 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-07 13:47:55,204 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-07 13:47:55,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 717#(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-07 13:47:55,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:47:55,204 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 703#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:55,205 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 693#(exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) [2019-10-07 13:47:55,205 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:55,205 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 613#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-07 13:47:55,205 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 708#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:55,206 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-07 13:47:55,206 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 689#true [2019-10-07 13:47:55,694 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:47:55,695 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 16] total 28 [2019-10-07 13:47:55,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-07 13:47:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-07 13:47:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-10-07 13:47:55,698 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 28 states. [2019-10-07 13:47:56,312 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-10-07 13:48:03,346 WARN L191 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-07 13:48:03,865 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:48:10,634 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-10-07 13:48:14,769 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-07 13:48:19,056 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-07 13:48:21,532 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-07 13:48:21,746 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-07 13:48:26,104 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 56 [2019-10-07 13:48:30,288 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-07 13:48:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:31,200 INFO L93 Difference]: Finished difference Result 180 states and 233 transitions. [2019-10-07 13:48:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-07 13:48:31,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-10-07 13:48:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:31,204 INFO L225 Difference]: With dead ends: 180 [2019-10-07 13:48:31,204 INFO L226 Difference]: Without dead ends: 156 [2019-10-07 13:48:31,206 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=1177, Invalid=4982, Unknown=3, NotChecked=0, Total=6162 [2019-10-07 13:48:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-07 13:48:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 40. [2019-10-07 13:48:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 13:48:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-10-07 13:48:31,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2019-10-07 13:48:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:31,218 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-10-07 13:48:31,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-07 13:48:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-10-07 13:48:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:48:31,220 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:31,220 INFO L385 BasicCegarLoop]: trace histogram [10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:31,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:48:31,424 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -777139230, now seen corresponding path program 3 times [2019-10-07 13:48:31,425 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:31,425 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:31,425 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:31,425 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 13:48:31,559 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:31,559 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:48:31,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:48:31,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:48:31,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:48:31,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-07 13:48:31,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:48:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 13:48:31,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:48:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 13:48:31,856 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:48:31,858 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 13:48:31,858 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:48:31,858 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:48:31,859 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:48:31,859 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:48:31,878 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:48:31,949 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:48:32,286 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:48:32,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:48:32,297 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:48:32,298 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:48:32,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 760#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:48:32,298 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-07 13:48:32,298 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 695#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-07 13:48:32,299 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 622#(<= 0 main_~j~0) [2019-10-07 13:48:32,299 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 746#(and (exists ((v_prenex_15 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:48:32,299 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 434#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:48:32,299 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-07 13:48:32,299 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 426#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:48:32,300 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-07 13:48:32,300 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-07 13:48:32,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 765#(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-07 13:48:32,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:48:32,300 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 751#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_15 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:48:32,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 741#(exists ((v_prenex_15 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))))) [2019-10-07 13:48:32,301 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:48:32,301 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 661#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-07 13:48:32,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 756#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_15 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647) (= 0 (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_4|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 (mod v_prenex_15 4294967296) (- 4294967296))) 0) (not (<= (mod v_prenex_15 4294967296) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:48:32,302 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-07 13:48:32,302 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 737#true [2019-10-07 13:48:32,839 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:48:32,839 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6, 16] total 30 [2019-10-07 13:48:32,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 13:48:32,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 13:48:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2019-10-07 13:48:32,842 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 30 states. [2019-10-07 13:48:34,074 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-07 13:48:40,229 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 13:48:41,380 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-07 13:48:45,565 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 13:48:46,892 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-07 13:48:51,199 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 13:48:52,547 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-07 13:48:56,734 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-10-07 13:48:58,099 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:49:03,813 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-07 13:49:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,998 INFO L93 Difference]: Finished difference Result 142 states and 204 transitions. [2019-10-07 13:49:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-07 13:49:04,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2019-10-07 13:49:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,000 INFO L225 Difference]: With dead ends: 142 [2019-10-07 13:49:05,001 INFO L226 Difference]: Without dead ends: 124 [2019-10-07 13:49:05,003 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=1325, Invalid=7794, Unknown=1, NotChecked=0, Total=9120 [2019-10-07 13:49:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-07 13:49:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 48. [2019-10-07 13:49:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-07 13:49:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-07 13:49:05,019 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 39 [2019-10-07 13:49:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,019 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-07 13:49:05,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 13:49:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-07 13:49:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:05,020 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,021 INFO L385 BasicCegarLoop]: trace histogram [10, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:05,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:49:05,224 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 977005563, now seen corresponding path program 4 times [2019-10-07 13:49:05,225 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,225 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,226 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,226 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-07 13:49:05,398 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,398 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:49:05,399 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:49:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-07 13:49:05,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:49:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-07 13:49:05,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:49:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-07 13:49:05,943 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:49:05,944 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 13:49:05,944 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:49:05,945 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:49:05,945 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:49:05,945 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:49:05,968 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:49:06,045 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:49:06,323 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:49:06,328 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:49:06,332 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:49:06,332 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:49:06,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 734#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:49:06,332 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:06,332 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 596#(<= 0 main_~j~0) [2019-10-07 13:49:06,333 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 682#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-07 13:49:06,333 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 720#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#string_entrada~0.offset_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0))))) [2019-10-07 13:49:06,333 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 434#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:06,333 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-07 13:49:06,333 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 426#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:06,333 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-07 13:49:06,334 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-07 13:49:06,334 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 739#(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-07 13:49:06,334 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:49:06,339 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 725#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#string_entrada~0.offset_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0))))) [2019-10-07 13:49:06,339 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 715#(exists ((|v_main_~#string_entrada~0.offset_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0)))) [2019-10-07 13:49:06,339 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:06,339 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 635#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-07 13:49:06,340 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 730#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#string_entrada~0.offset_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_18) (+ v_prenex_17 (mod v_prenex_19 4294967296))) 0) (<= (mod v_prenex_19 4294967296) 2147483647)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_5|) (+ |v_main_~#string_entrada~0.offset_BEFORE_CALL_5| (mod v_main_~i~0_BEFORE_CALL_5 4294967296) (- 4294967296))) 0))))) [2019-10-07 13:49:06,340 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-07 13:49:06,340 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 711#true [2019-10-07 13:49:07,150 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:49:07,150 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 11, 16] total 45 [2019-10-07 13:49:07,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-07 13:49:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-07 13:49:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1807, Unknown=0, NotChecked=0, Total=1980 [2019-10-07 13:49:07,152 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 45 states. [2019-10-07 13:49:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:31,124 INFO L93 Difference]: Finished difference Result 290 states and 372 transitions. [2019-10-07 13:49:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-10-07 13:49:31,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2019-10-07 13:49:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:31,127 INFO L225 Difference]: With dead ends: 290 [2019-10-07 13:49:31,128 INFO L226 Difference]: Without dead ends: 264 [2019-10-07 13:49:31,138 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10849 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3065, Invalid=33225, Unknown=0, NotChecked=0, Total=36290 [2019-10-07 13:49:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-07 13:49:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 52. [2019-10-07 13:49:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-07 13:49:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-07 13:49:31,155 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 47 [2019-10-07 13:49:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:31,155 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-07 13:49:31,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-07 13:49:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-07 13:49:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:31,156 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:31,157 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:31,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:49:31,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:31,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1110618139, now seen corresponding path program 5 times [2019-10-07 13:49:31,363 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:31,363 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:31,363 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:31,363 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 13:49:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 13:49:32,564 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-07 13:49:32,564 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-07 13:49:32,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:49:32 BoogieIcfgContainer [2019-10-07 13:49:32,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:49:32,669 INFO L168 Benchmark]: Toolchain (without parser) took 113572.25 ms. Allocated memory was 138.4 MB in the beginning and 457.2 MB in the end (delta: 318.8 MB). Free memory was 103.6 MB in the beginning and 370.6 MB in the end (delta: -267.0 MB). Peak memory consumption was 345.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,669 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.55 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 92.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,670 INFO L168 Benchmark]: Boogie Preprocessor took 125.05 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,673 INFO L168 Benchmark]: RCFGBuilder took 527.74 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 152.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,675 INFO L168 Benchmark]: TraceAbstraction took 112614.32 ms. Allocated memory was 202.4 MB in the beginning and 457.2 MB in the end (delta: 254.8 MB). Free memory was 151.9 MB in the beginning and 370.6 MB in the end (delta: -218.7 MB). Peak memory consumption was 330.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:32,676 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.55 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 92.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.05 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 527.74 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 152.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112614.32 ms. Allocated memory was 202.4 MB in the beginning and 457.2 MB in the end (delta: 254.8 MB). Free memory was 151.9 MB in the beginning and 370.6 MB in the end (delta: -218.7 MB). Peak memory consumption was 330.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] char string_entrada[10], vetor_vogais[]={'a','A','e','E','i','I','o','O','u','U','\0'}; [L16] unsigned int i,j,cont, tam_string, n_caracter; [L18] i=0 VAL [i=0, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=1, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=2, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=3, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=4, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=5, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=6, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=7, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=8, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=9, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ VAL [i=10, string_entrada={1:0}, vetor_vogais={-1:0}] [L18] COND FALSE !(i<10) [L21] string_entrada[10 -1]='\0' [L23] n_caracter = 0 VAL [i=10, n_caracter=0, string_entrada={1:0}, vetor_vogais={-1:0}] [L24] EXPR string_entrada[n_caracter] VAL [i=10, n_caracter=0, string_entrada={1:0}, string_entrada[n_caracter]=85, vetor_vogais={-1:0}] [L24] COND TRUE string_entrada[n_caracter]!='\0' [L25] n_caracter++ VAL [i=10, n_caracter=1, string_entrada={1:0}, vetor_vogais={-1:0}] [L24] EXPR string_entrada[n_caracter] VAL [i=10, n_caracter=1, string_entrada={1:0}, string_entrada[n_caracter]=0, vetor_vogais={-1:0}] [L24] COND FALSE !(string_entrada[n_caracter]!='\0') [L27] cont = 0 [L28] i=0 VAL [cont=0, i=0, n_caracter=1, string_entrada={1:0}, vetor_vogais={-1:0}] [L28] COND TRUE i