java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_password_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:15:02,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:15:02,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:15:02,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:15:02,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:15:02,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:15:02,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:15:02,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:15:02,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:15:02,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:15:02,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:15:02,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:15:02,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:15:02,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:15:02,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:15:02,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:15:02,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:15:02,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:15:02,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:15:02,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:15:02,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:15:02,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:15:02,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:15:02,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:15:02,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:15:02,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:15:02,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:15:02,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:15:02,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:15:02,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:15:02,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:15:02,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:15:02,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:15:02,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:15:02,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:15:02,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:15:02,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:15:02,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:15:02,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:15:02,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:15:02,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:15:02,195 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 00:15:02,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:15:02,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:15:02,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:15:02,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:15:02,231 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:15:02,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:15:02,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:15:02,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:15:02,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:15:02,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:15:02,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:15:02,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:15:02,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:15:02,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:15:02,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:15:02,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:15:02,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:15:02,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:15:02,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:15:02,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:15:02,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:15:02,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:15:02,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:15:02,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:15:02,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:15:02,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:15:02,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:15:02,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:15:02,237 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 00:15:02,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:15:02,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:15:02,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:15:02,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:15:02,530 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:15:02,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_password_ground.i [2019-10-07 00:15:02,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ab320c9/db15679c88164cfc8e9e564924fc06ce/FLAGea208655e [2019-10-07 00:15:03,030 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:15:03,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_password_ground.i [2019-10-07 00:15:03,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ab320c9/db15679c88164cfc8e9e564924fc06ce/FLAGea208655e [2019-10-07 00:15:03,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ab320c9/db15679c88164cfc8e9e564924fc06ce [2019-10-07 00:15:03,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:15:03,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:15:03,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:03,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:15:03,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:15:03,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd8e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03, skipping insertion in model container [2019-10-07 00:15:03,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,466 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:15:03,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:15:03,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:03,676 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:15:03,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:03,720 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:15:03,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03 WrapperNode [2019-10-07 00:15:03,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:03,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:15:03,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:15:03,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:15:03,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... [2019-10-07 00:15:03,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:15:03,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:15:03,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:15:03,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:15:03,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:15:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:15:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:15:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:15:03,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:15:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:15:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:15:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:15:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:15:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:15:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:15:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:15:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:15:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:15:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:15:04,288 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:15:04,288 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:15:04,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:04 BoogieIcfgContainer [2019-10-07 00:15:04,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:15:04,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:15:04,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:15:04,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:15:04,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:15:03" (1/3) ... [2019-10-07 00:15:04,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1f5c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:04, skipping insertion in model container [2019-10-07 00:15:04,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:03" (2/3) ... [2019-10-07 00:15:04,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1f5c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:04, skipping insertion in model container [2019-10-07 00:15:04,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:04" (3/3) ... [2019-10-07 00:15:04,300 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_password_ground.i [2019-10-07 00:15:04,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:15:04,316 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:15:04,327 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:15:04,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:15:04,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:15:04,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:15:04,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:15:04,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:15:04,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:15:04,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:15:04,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:15:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-07 00:15:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:15:04,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:04,374 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:04,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1967025528, now seen corresponding path program 1 times [2019-10-07 00:15:04,390 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:04,390 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:04,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:04,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:04,528 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 00:15:04,529 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:04,530 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:15:04,530 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:15:04,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:15:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:15:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:15:04,546 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-07 00:15:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:04,598 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-10-07 00:15:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:15:04,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:15:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:04,611 INFO L225 Difference]: With dead ends: 38 [2019-10-07 00:15:04,611 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:15:04,616 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 00:15:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:15:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 00:15:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:15:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-07 00:15:04,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2019-10-07 00:15:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:04,660 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-07 00:15:04,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:15:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-07 00:15:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:15:04,661 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:04,661 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:04,662 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1900792287, now seen corresponding path program 1 times [2019-10-07 00:15:04,663 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:04,663 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:04,664 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:04,664 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:15:04,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:04,754 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:04,754 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 00:15:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:04,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:15:04,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:15:04,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:15:04,937 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:04,967 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:04,968 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:04,988 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:05,002 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:05,002 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:05,219 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:05,584 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:15:05,607 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:05,618 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:05,619 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:05,619 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (exists ((v_prenex_4 Int) (|v_main_~#password~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#password~0.offset_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) |v_main_~#password~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) |v_main_~#guess~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_2)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:05,620 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#password~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#password~0.offset_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) |v_main_~#password~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) |v_main_~#guess~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_2)))))) (<= 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 00:15:05,620 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:05,620 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#password~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#password~0.offset_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) |v_main_~#password~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) |v_main_~#guess~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_2)))))) (<= 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 00:15:05,621 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:05,621 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:15:05,622 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:05,622 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 00:15:05,623 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 00:15:05,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:15:05,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:05,625 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:15:05,625 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((v_prenex_4 Int) (|v_main_~#password~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#password~0.offset_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) |v_main_~#password~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) |v_main_~#guess~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_2)))))) [2019-10-07 00:15:05,626 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:05,904 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:05,904 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 17 [2019-10-07 00:15:05,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:15:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:15:05,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:15:05,908 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 17 states. [2019-10-07 00:15:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:06,564 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-10-07 00:15:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 00:15:06,566 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-10-07 00:15:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:06,568 INFO L225 Difference]: With dead ends: 46 [2019-10-07 00:15:06,568 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 00:15:06,571 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-10-07 00:15:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 00:15:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-07 00:15:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:15:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 00:15:06,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2019-10-07 00:15:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:06,597 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 00:15:06,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:15:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 00:15:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:15:06,605 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:06,605 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:06,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:06,812 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -365657160, now seen corresponding path program 2 times [2019-10-07 00:15:06,813 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:06,813 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:06,813 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:06,813 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:15:06,904 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:06,904 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:06,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:06,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:15:06,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:06,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:15:06,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:15:07,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:15:07,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:07,080 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:07,080 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:07,081 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:07,081 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:07,081 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:07,133 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:07,362 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:15:07,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:07,383 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:07,384 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:07,384 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#guess~0.offset_BEFORE_CALL_2| Int) (|v_main_~#password~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int) (|v_main_~#password~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) |v_main_~#guess~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) |v_main_~#password~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_5) (select (select |#memory_int| v_prenex_6) v_prenex_8))))))) [2019-10-07 00:15:07,385 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(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_~#guess~0.offset_BEFORE_CALL_2| Int) (|v_main_~#password~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int) (|v_main_~#password~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) |v_main_~#guess~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) |v_main_~#password~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_5) (select (select |#memory_int| v_prenex_6) v_prenex_8))))))) [2019-10-07 00:15:07,386 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:07,386 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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_~#guess~0.offset_BEFORE_CALL_2| Int) (|v_main_~#password~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int) (|v_main_~#password~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) |v_main_~#guess~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) |v_main_~#password~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_5) (select (select |#memory_int| v_prenex_6) v_prenex_8))))))) [2019-10-07 00:15:07,387 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:07,387 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:15:07,387 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:07,388 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 00:15:07,388 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 00:15:07,388 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:15:07,388 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:07,389 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:15:07,389 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((|v_main_~#guess~0.offset_BEFORE_CALL_2| Int) (|v_main_~#password~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int) (|v_main_~#password~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) |v_main_~#guess~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) |v_main_~#password~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_5) (select (select |#memory_int| v_prenex_6) v_prenex_8)))))) [2019-10-07 00:15:07,390 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:07,693 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:07,693 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 24 [2019-10-07 00:15:07,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 00:15:07,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 00:15:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:15:07,695 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 24 states. [2019-10-07 00:15:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:08,443 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-10-07 00:15:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 00:15:08,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-10-07 00:15:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:08,445 INFO L225 Difference]: With dead ends: 61 [2019-10-07 00:15:08,445 INFO L226 Difference]: Without dead ends: 46 [2019-10-07 00:15:08,446 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1394, Unknown=0, NotChecked=0, Total=1722 [2019-10-07 00:15:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-07 00:15:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-07 00:15:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 00:15:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-07 00:15:08,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 21 [2019-10-07 00:15:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:08,456 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-07 00:15:08,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 00:15:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-07 00:15:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 00:15:08,457 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:08,457 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:08,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:08,669 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1691275544, now seen corresponding path program 3 times [2019-10-07 00:15:08,669 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:08,669 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:08,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:08,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:15:08,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:08,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:08,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:09,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:15:09,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:09,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:15:09,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:15:09,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:15:09,240 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:09,242 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:09,242 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:09,242 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:09,243 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:09,243 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:09,276 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:11,454 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:15:11,462 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:11,466 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:11,466 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:11,467 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (exists ((|v_main_~#guess~0.offset_BEFORE_CALL_3| Int) (|v_main_~#password~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int) (|v_main_~#password~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) |v_main_~#guess~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) |v_main_~#password~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_9) (select (select |#memory_int| v_prenex_10) v_prenex_12))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:11,467 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#guess~0.offset_BEFORE_CALL_3| Int) (|v_main_~#password~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int) (|v_main_~#password~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) |v_main_~#guess~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) |v_main_~#password~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_9) (select (select |#memory_int| v_prenex_10) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:11,467 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#guess~0.offset_BEFORE_CALL_3| Int) (|v_main_~#password~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int) (|v_main_~#password~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) |v_main_~#guess~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) |v_main_~#password~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_9) (select (select |#memory_int| v_prenex_10) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:11,468 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:11,468 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 121#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:11,469 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 116#(<= 0 main_~i~0) [2019-10-07 00:15:11,469 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 131#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:11,471 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 00:15:11,474 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 00:15:11,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(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 00:15:11,475 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:11,475 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 74#true [2019-10-07 00:15:11,476 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(exists ((|v_main_~#guess~0.offset_BEFORE_CALL_3| Int) (|v_main_~#password~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int) (|v_main_~#password~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) |v_main_~#guess~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) |v_main_~#password~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_9) (select (select |#memory_int| v_prenex_10) v_prenex_12))))) [2019-10-07 00:15:11,476 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 126#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:11,836 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:11,836 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 12] total 36 [2019-10-07 00:15:11,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-07 00:15:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-07 00:15:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 00:15:11,839 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 36 states. [2019-10-07 00:15:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:13,251 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-10-07 00:15:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-07 00:15:13,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 33 [2019-10-07 00:15:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:13,253 INFO L225 Difference]: With dead ends: 91 [2019-10-07 00:15:13,253 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 00:15:13,255 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=994, Invalid=3296, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 00:15:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 00:15:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-07 00:15:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-07 00:15:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-07 00:15:13,270 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 33 [2019-10-07 00:15:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:13,270 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-07 00:15:13,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-07 00:15:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-07 00:15:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 00:15:13,273 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:13,273 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:13,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:13,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash 24224728, now seen corresponding path program 4 times [2019-10-07 00:15:13,478 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:13,479 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:13,479 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:13,479 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:15:13,945 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:13,945 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:13,946 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:15:14,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:15:14,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:15:14,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:14,772 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:14,773 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:14,773 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:14,773 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:14,773 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:14,812 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:14,945 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:15:14,952 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:14,956 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:14,956 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:14,957 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_4| Int) (|v_main_~#password~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int) (|v_main_~#password~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) |v_main_~#guess~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) |v_main_~#password~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_13) (select (select |#memory_int| v_prenex_14) v_prenex_16))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:14,957 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_4| Int) (|v_main_~#password~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int) (|v_main_~#password~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) |v_main_~#guess~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) |v_main_~#password~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_13) (select (select |#memory_int| v_prenex_14) v_prenex_16))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:14,957 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_4| Int) (|v_main_~#password~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int) (|v_main_~#password~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) |v_main_~#guess~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) |v_main_~#password~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_13) (select (select |#memory_int| v_prenex_14) v_prenex_16))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:14,957 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:14,958 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:14,958 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:15:14,958 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:14,958 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 00:15:14,958 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 00:15:14,959 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:15:14,959 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:14,960 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:15:14,961 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_4| Int) (|v_main_~#password~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int) (|v_main_~#password~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) |v_main_~#guess~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) |v_main_~#password~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_13) (select (select |#memory_int| v_prenex_14) v_prenex_16))))) [2019-10-07 00:15:14,961 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:15,376 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:15,376 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 12] total 60 [2019-10-07 00:15:15,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-07 00:15:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-07 00:15:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1211, Invalid=2329, Unknown=0, NotChecked=0, Total=3540 [2019-10-07 00:15:15,384 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 60 states. [2019-10-07 00:15:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:18,528 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2019-10-07 00:15:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-07 00:15:18,531 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 57 [2019-10-07 00:15:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:18,532 INFO L225 Difference]: With dead ends: 151 [2019-10-07 00:15:18,532 INFO L226 Difference]: Without dead ends: 118 [2019-10-07 00:15:18,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3622, Invalid=9260, Unknown=0, NotChecked=0, Total=12882 [2019-10-07 00:15:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-07 00:15:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-10-07 00:15:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-07 00:15:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-10-07 00:15:18,552 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 57 [2019-10-07 00:15:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:18,553 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-10-07 00:15:18,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-07 00:15:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-10-07 00:15:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 00:15:18,556 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:18,556 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:18,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:18,763 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash 227027288, now seen corresponding path program 5 times [2019-10-07 00:15:18,764 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:18,764 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:18,764 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:18,764 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:15:19,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:19,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:19,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:18:04,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:18:04,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:18:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:18:04,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:18:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:18:04,187 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:18:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:18:06,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:18:06,638 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:18:06,638 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:18:06,638 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:18:06,639 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:18:06,639 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:18:06,681 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:18:06,811 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:18:06,817 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:18:06,821 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:18:06,821 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:18:06,821 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (exists ((v_prenex_18 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#password~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) |v_main_~#password~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) |v_main_~#guess~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_20) (select (select |#memory_int| v_prenex_19) v_prenex_17)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:18:06,822 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#password~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) |v_main_~#password~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) |v_main_~#guess~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_20) (select (select |#memory_int| v_prenex_19) v_prenex_17)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:18:06,822 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#password~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) |v_main_~#password~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) |v_main_~#guess~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_20) (select (select |#memory_int| v_prenex_19) v_prenex_17)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:18:06,822 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:18:06,823 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:18:06,823 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:18:06,824 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:06,826 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 00:18:06,827 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 00:18:06,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:18:06,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:18:06,827 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:18:06,827 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((v_prenex_18 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#password~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) |v_main_~#password~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) |v_main_~#guess~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_20) (select (select |#memory_int| v_prenex_19) v_prenex_17)))))) [2019-10-07 00:18:06,828 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:07,332 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:18:07,333 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 12] total 108 [2019-10-07 00:18:07,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-10-07 00:18:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-10-07 00:18:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=6865, Unknown=0, NotChecked=0, Total=11556 [2019-10-07 00:18:07,338 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 108 states. [2019-10-07 00:18:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:18:16,112 INFO L93 Difference]: Finished difference Result 271 states and 370 transitions. [2019-10-07 00:18:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-07 00:18:16,112 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 105 [2019-10-07 00:18:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:18:16,115 INFO L225 Difference]: With dead ends: 271 [2019-10-07 00:18:16,115 INFO L226 Difference]: Without dead ends: 214 [2019-10-07 00:18:16,124 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8800 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14062, Invalid=29828, Unknown=0, NotChecked=0, Total=43890 [2019-10-07 00:18:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-07 00:18:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2019-10-07 00:18:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-07 00:18:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2019-10-07 00:18:16,151 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 105 [2019-10-07 00:18:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:18:16,152 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2019-10-07 00:18:16,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-10-07 00:18:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2019-10-07 00:18:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 00:18:16,155 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:18:16,156 INFO L385 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:18:16,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:18:16,357 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:18:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:18:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -575097768, now seen corresponding path program 6 times [2019-10-07 00:18:16,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:18:16,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:18:16,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:18:16,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:18:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:18:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:18:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:18:20,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:18:20,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:18:20,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:18:20,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:18:20,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:18:20,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:18:20,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:18:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:18:20,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:18:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 00:18:30,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:18:30,171 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:18:30,171 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:18:30,172 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:18:30,172 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:18:30,172 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:18:30,190 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:18:30,316 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:18:30,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:18:30,324 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:18:30,325 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:18:30,325 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (exists ((|v_main_~#password~0.offset_BEFORE_CALL_6| Int) (|v_main_~#password~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) |v_main_~#password~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) |v_main_~#guess~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:18:30,325 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#password~0.offset_BEFORE_CALL_6| Int) (|v_main_~#password~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) |v_main_~#password~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) |v_main_~#guess~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 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 00:18:30,325 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#password~0.offset_BEFORE_CALL_6| Int) (|v_main_~#password~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) |v_main_~#password~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) |v_main_~#guess~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 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 00:18:30,326 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:18:30,326 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:18:30,326 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:18:30,326 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:30,326 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 00:18:30,327 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 00:18:30,327 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:18:30,327 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:18:30,327 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:18:30,327 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((|v_main_~#password~0.offset_BEFORE_CALL_6| Int) (|v_main_~#password~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#guess~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) |v_main_~#password~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) |v_main_~#guess~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_22) v_prenex_21) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) [2019-10-07 00:18:30,328 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:31,134 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:18:31,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 12] total 204 [2019-10-07 00:18:31,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 204 states [2019-10-07 00:18:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2019-10-07 00:18:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18563, Invalid=22849, Unknown=0, NotChecked=0, Total=41412 [2019-10-07 00:18:31,142 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 204 states. [2019-10-07 00:19:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:19:01,668 INFO L93 Difference]: Finished difference Result 511 states and 706 transitions. [2019-10-07 00:19:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-10-07 00:19:01,669 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 201 [2019-10-07 00:19:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:19:01,672 INFO L225 Difference]: With dead ends: 511 [2019-10-07 00:19:01,672 INFO L226 Difference]: Without dead ends: 406 [2019-10-07 00:19:01,678 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29128 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=55678, Invalid=105524, Unknown=0, NotChecked=0, Total=161202 [2019-10-07 00:19:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-07 00:19:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2019-10-07 00:19:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-07 00:19:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 399 transitions. [2019-10-07 00:19:01,721 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 399 transitions. Word has length 201 [2019-10-07 00:19:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:19:01,722 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 399 transitions. [2019-10-07 00:19:01,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 204 states. [2019-10-07 00:19:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 399 transitions. [2019-10-07 00:19:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-07 00:19:01,730 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:19:01,730 INFO L385 BasicCegarLoop]: trace histogram [190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:19:01,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:19:01,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:19:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:19:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 69716568, now seen corresponding path program 7 times [2019-10-07 00:19:01,935 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:19:01,936 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:19:01,936 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:19:01,936 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:19:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:19:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:19:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:19:15,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:19:15,943 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:19:15,943 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:19:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:19:16,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 00:19:16,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:19:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:19:16,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:19:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:19:54,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:19:54,837 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:19:54,837 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:19:54,838 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:19:54,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:19:54,838 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:19:54,878 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:19:54,986 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:19:54,991 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:19:54,994 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:19:54,995 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:19:54,995 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 139#(and (exists ((v_prenex_27 Int) (|v_main_~#password~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#password~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#guess~0.base_BEFORE_CALL_7| Int) (|v_main_~#guess~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_7|) |v_main_~#guess~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_7|) |v_main_~#password~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:19:54,995 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 144#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_27 Int) (|v_main_~#password~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#password~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#guess~0.base_BEFORE_CALL_7| Int) (|v_main_~#guess~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_7|) |v_main_~#guess~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_7|) |v_main_~#password~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25))))) (<= 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 00:19:54,996 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_27 Int) (|v_main_~#password~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#password~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#guess~0.base_BEFORE_CALL_7| Int) (|v_main_~#guess~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_7|) |v_main_~#guess~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_7|) |v_main_~#password~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25))))) (<= 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 00:19:54,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:19:54,996 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 119#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:19:54,996 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 114#(<= 0 main_~i~0) [2019-10-07 00:19:54,996 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 129#(and (< main_~x~0 100000) (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ (* 4 main_~x~0) |main_~#guess~0.offset|)) |main_#t~mem8|) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#password~0.base|) (+ (* 4 main_~x~0) |main_~#password~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:19:54,997 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 00:19:54,997 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 00:19:54,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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 00:19:54,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:19:54,997 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-07 00:19:54,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(exists ((v_prenex_27 Int) (|v_main_~#password~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#password~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#guess~0.base_BEFORE_CALL_7| Int) (|v_main_~#guess~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_7|) |v_main_~#guess~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_7|) |v_main_~#password~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_27) v_prenex_28) (select (select |#memory_int| v_prenex_26) v_prenex_25))))) [2019-10-07 00:19:54,998 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 124#(and (not (= 0 main_~result~0)) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:19:56,298 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:19:56,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 12] total 396 [2019-10-07 00:19:56,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 396 states [2019-10-07 00:19:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 396 interpolants. [2019-10-07 00:19:56,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73955, Invalid=82465, Unknown=0, NotChecked=0, Total=156420 [2019-10-07 00:19:56,314 INFO L87 Difference]: Start difference. First operand 397 states and 399 transitions. Second operand 396 states. [2019-10-07 00:22:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:49,196 INFO L93 Difference]: Finished difference Result 991 states and 1378 transitions. [2019-10-07 00:22:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 395 states. [2019-10-07 00:22:49,197 INFO L78 Accepts]: Start accepts. Automaton has 396 states. Word has length 393 [2019-10-07 00:22:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:49,202 INFO L225 Difference]: With dead ends: 991 [2019-10-07 00:22:49,202 INFO L226 Difference]: Without dead ends: 790 [2019-10-07 00:22:49,217 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2145 GetRequests, 1361 SyntacticMatches, 0 SemanticMatches, 784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104344 ImplicationChecksByTransitivity, 137.9s TimeCoverageRelationStatistics Valid=221854, Invalid=395156, Unknown=0, NotChecked=0, Total=617010 [2019-10-07 00:22:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-07 00:22:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 781. [2019-10-07 00:22:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-07 00:22:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 783 transitions. [2019-10-07 00:22:49,267 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 783 transitions. Word has length 393 [2019-10-07 00:22:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:49,268 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 783 transitions. [2019-10-07 00:22:49,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 396 states. [2019-10-07 00:22:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 783 transitions. [2019-10-07 00:22:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2019-10-07 00:22:49,295 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:49,295 INFO L385 BasicCegarLoop]: trace histogram [382, 382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:49,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:49,503 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1723992488, now seen corresponding path program 8 times [2019-10-07 00:22:49,504 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:49,504 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:49,504 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:49,504 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:23:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 146306 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 73153 trivial. 0 not checked. [2019-10-07 00:23:43,332 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:43,332 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:23:43,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true