java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_password_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:05:45,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:45,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:45,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:45,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:45,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:45,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:45,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:45,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:45,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:45,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:45,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:45,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:45,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:45,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:45,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:45,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:45,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:45,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:45,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:45,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:45,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:45,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:45,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:45,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:45,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:45,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:45,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:45,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:45,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:45,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:45,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:45,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:45,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:45,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:45,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:45,812 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:05:45,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:45,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:45,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:05:45,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:05:45,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:45,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:45,847 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:05:45,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:45,847 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:45,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:45,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:45,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:45,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:05:45,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:05:45,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:05:45,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:45,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:45,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:45,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:05:45,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:45,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:05:45,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:05:45,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:05:45,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:45,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:45,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:05:45,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:05:45,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:05:45,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:05:45,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:05:45,854 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:05:45,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:45,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:45,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:45,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:45,949 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:45,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_password_true-unreach-call_ground.i [2018-11-23 12:05:46,021 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9114d32/7f15788038f948fe8ffd8945916ebcf5/FLAGcfde44059 [2018-11-23 12:05:46,510 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:46,511 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_password_true-unreach-call_ground.i [2018-11-23 12:05:46,517 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9114d32/7f15788038f948fe8ffd8945916ebcf5/FLAGcfde44059 [2018-11-23 12:05:46,850 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9114d32/7f15788038f948fe8ffd8945916ebcf5 [2018-11-23 12:05:46,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:46,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:46,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:46,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:46,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:46,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:46" (1/1) ... [2018-11-23 12:05:46,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2193ab3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:46, skipping insertion in model container [2018-11-23 12:05:46,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:46" (1/1) ... [2018-11-23 12:05:46,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:46,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:47,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:47,120 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:47,151 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:47,176 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:47,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47 WrapperNode [2018-11-23 12:05:47,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:47,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:47,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:47,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:47,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:47,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:47,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:47,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:47,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (1/1) ... [2018-11-23 12:05:47,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:47,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:47,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:47,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:47,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (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 [2018-11-23 12:05:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:05:47,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:05:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:47,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:47,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:05:47,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:05:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:05:47,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:05:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:47,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:47,936 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:05:47,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:47 BoogieIcfgContainer [2018-11-23 12:05:47,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:47,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:05:47,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:05:47,942 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:05:47,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:46" (1/3) ... [2018-11-23 12:05:47,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69416b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:47, skipping insertion in model container [2018-11-23 12:05:47,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:47" (2/3) ... [2018-11-23 12:05:47,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69416b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:47, skipping insertion in model container [2018-11-23 12:05:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:47" (3/3) ... [2018-11-23 12:05:47,946 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_password_true-unreach-call_ground.i [2018-11-23 12:05:47,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:05:47,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:05:47,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:05:48,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:48,020 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:05:48,020 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:05:48,020 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:05:48,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:48,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:48,021 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:05:48,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:48,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:05:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:05:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:48,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:48,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:48,053 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:48,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1324484839, now seen corresponding path program 1 times [2018-11-23 12:05:48,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:48,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:05:48,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:05:48,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:05:48,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #59#return; {28#true} is VALID [2018-11-23 12:05:48,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2018-11-23 12:05:48,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {28#true} is VALID [2018-11-23 12:05:48,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:05:48,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 12:05:48,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 12:05:48,226 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {29#false} is VALID [2018-11-23 12:05:48,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 12:05:48,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 12:05:48,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:05:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:05:48,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:48,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:48,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:05:48,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:48,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:05:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:05:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:48,329 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:05:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:48,734 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 12:05:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:05:48,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:05:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:05:48,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 12:05:49,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,105 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:05:49,105 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:05:49,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:05:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:05:49,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:49,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:49,169 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:49,170 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,174 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:05:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:49,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,175 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:49,175 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:05:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,179 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:05:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:49,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:49,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:05:49,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 12:05:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:49,185 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:05:49,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:05:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:05:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:49,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:49,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:49,187 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:49,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash 151878940, now seen corresponding path program 1 times [2018-11-23 12:05:49,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:49,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:49,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 12:05:49,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 12:05:49,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 12:05:49,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #59#return; {152#true} is VALID [2018-11-23 12:05:49,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret6 := main(); {152#true} is VALID [2018-11-23 12:05:49,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {154#(= main_~i~0 0)} is VALID [2018-11-23 12:05:49,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 12:05:49,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 12:05:49,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 12:05:49,274 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {153#false} is VALID [2018-11-23 12:05:49,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 12:05:49,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 12:05:49,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 12:05:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:49,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:49,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:49,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:49,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:49,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:49,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:49,388 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:05:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,543 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:05:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:49,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:49,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 12:05:49,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,657 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:05:49,657 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:05:49,658 INFO L631 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 [2018-11-23 12:05:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:05:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 12:05:49,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:49,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:49,671 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:49,671 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 12:05:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,674 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:05:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:05:49,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,676 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 12:05:49,676 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 12:05:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,679 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:05:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:05:49,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:49,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:05:49,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 12:05:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:49,682 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:05:49,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:05:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:05:49,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:49,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:49,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:49,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash 968387775, now seen corresponding path program 1 times [2018-11-23 12:05:49,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:49,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 12:05:49,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 12:05:49,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 12:05:49,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #59#return; {279#true} is VALID [2018-11-23 12:05:49,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret6 := main(); {279#true} is VALID [2018-11-23 12:05:49,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {279#true} is VALID [2018-11-23 12:05:49,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {279#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {279#true} is VALID [2018-11-23 12:05:49,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#true} assume #t~mem1 != #t~mem2;havoc #t~mem2;havoc #t~mem1;~result~0 := 0; {281#(= main_~result~0 0)} is VALID [2018-11-23 12:05:49,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(= main_~result~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {281#(= main_~result~0 0)} is VALID [2018-11-23 12:05:49,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {281#(= main_~result~0 0)} assume !(~i~0 < 100000); {281#(= main_~result~0 0)} is VALID [2018-11-23 12:05:49,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {281#(= main_~result~0 0)} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 12:05:49,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 12:05:49,768 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {280#false} is VALID [2018-11-23 12:05:49,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 12:05:49,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 12:05:49,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 12:05:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:49,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:49,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:49,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:05:49,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:49,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:49,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:49,967 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-11-23 12:05:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,352 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:05:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:50,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:05:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 12:05:50,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 12:05:50,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:50,444 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:05:50,444 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:05:50,445 INFO L631 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 [2018-11-23 12:05:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:05:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:05:50,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:50,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:05:50,470 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:05:50,470 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:05:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,473 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:05:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:05:50,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,474 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:05:50,474 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:05:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:50,476 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:05:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:05:50,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:50,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:50,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:50,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:05:50,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 12:05:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:50,480 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:05:50,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:05:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:05:50,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:50,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:50,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:50,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1648446145, now seen corresponding path program 1 times [2018-11-23 12:05:50,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:50,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 12:05:50,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {404#true} is VALID [2018-11-23 12:05:50,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 12:05:50,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #59#return; {404#true} is VALID [2018-11-23 12:05:50,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret6 := main(); {404#true} is VALID [2018-11-23 12:05:50,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {406#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {406#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {406#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {406#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {406#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {406#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {407#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(<= main_~i~0 1)} assume !(~i~0 < 100000); {405#false} is VALID [2018-11-23 12:05:50,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {405#false} is VALID [2018-11-23 12:05:50,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {405#false} is VALID [2018-11-23 12:05:50,615 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {405#false} is VALID [2018-11-23 12:05:50,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 12:05:50,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0 == ~cond; {405#false} is VALID [2018-11-23 12:05:50,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 12:05:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:50,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:50,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:50,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 12:05:50,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {404#true} is VALID [2018-11-23 12:05:50,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 12:05:50,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #59#return; {404#true} is VALID [2018-11-23 12:05:50,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret6 := main(); {404#true} is VALID [2018-11-23 12:05:50,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {426#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {426#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {426#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {407#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(<= main_~i~0 1)} assume !(~i~0 < 100000); {405#false} is VALID [2018-11-23 12:05:50,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {405#false} is VALID [2018-11-23 12:05:50,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {405#false} is VALID [2018-11-23 12:05:50,973 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {405#false} is VALID [2018-11-23 12:05:50,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 12:05:50,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0 == ~cond; {405#false} is VALID [2018-11-23 12:05:50,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 12:05:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:50,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:05:50,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:50,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:50,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:05:51,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:05:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:05:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:51,027 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 12:05:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,258 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:05:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:51,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-23 12:05:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-23 12:05:51,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2018-11-23 12:05:51,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,442 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:05:51,442 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:05:51,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:05:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 12:05:51,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:51,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:51,479 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:51,479 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 12:05:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,482 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:05:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:05:51,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:51,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:51,483 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 12:05:51,483 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 12:05:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,485 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:05:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:05:51,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:51,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:51,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:51,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:05:51,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-11-23 12:05:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:51,489 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:05:51,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:05:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:05:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:05:51,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:51,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:51,491 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:51,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash -173449476, now seen corresponding path program 2 times [2018-11-23 12:05:51,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:51,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 12:05:51,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {592#true} is VALID [2018-11-23 12:05:51,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 12:05:51,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #59#return; {592#true} is VALID [2018-11-23 12:05:51,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret6 := main(); {592#true} is VALID [2018-11-23 12:05:51,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {592#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {594#(= main_~i~0 0)} is VALID [2018-11-23 12:05:51,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {594#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {594#(= main_~i~0 0)} is VALID [2018-11-23 12:05:51,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {594#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {594#(= main_~i~0 0)} is VALID [2018-11-23 12:05:51,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {594#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {596#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:51,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~i~0 2)} assume !(~i~0 < 100000); {593#false} is VALID [2018-11-23 12:05:51,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {593#false} is VALID [2018-11-23 12:05:51,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {593#false} is VALID [2018-11-23 12:05:51,623 INFO L256 TraceCheckUtils]: 15: Hoare triple {593#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {593#false} is VALID [2018-11-23 12:05:51,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2018-11-23 12:05:51,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2018-11-23 12:05:51,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 12:05:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:51,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:51,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:51,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:51,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:51,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:51,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 12:05:51,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {592#true} is VALID [2018-11-23 12:05:51,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 12:05:51,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #59#return; {592#true} is VALID [2018-11-23 12:05:51,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret6 := main(); {592#true} is VALID [2018-11-23 12:05:51,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {592#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {615#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {615#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {615#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {615#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:51,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {595#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:51,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {596#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:51,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~i~0 2)} assume !(~i~0 < 100000); {593#false} is VALID [2018-11-23 12:05:51,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {593#false} is VALID [2018-11-23 12:05:51,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {593#false} is VALID [2018-11-23 12:05:51,796 INFO L256 TraceCheckUtils]: 15: Hoare triple {593#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {593#false} is VALID [2018-11-23 12:05:51,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2018-11-23 12:05:51,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2018-11-23 12:05:51,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 12:05:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:51,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:51,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:05:51,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:51,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:51,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:05:51,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:05:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:05:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:51,857 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-23 12:05:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,067 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:05:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:05:52,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-23 12:05:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-23 12:05:52,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2018-11-23 12:05:52,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:52,142 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:05:52,142 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:05:52,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:05:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:05:52,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:52,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:52,157 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:52,157 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:05:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,160 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:05:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:05:52,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,162 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:05:52,162 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:05:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:52,164 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:05:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:05:52,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:52,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:52,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:52,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:05:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:05:52,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2018-11-23 12:05:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:52,167 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:05:52,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:05:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:05:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:05:52,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:52,169 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:52,169 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:52,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -764175135, now seen corresponding path program 3 times [2018-11-23 12:05:52,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:52,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:52,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 12:05:52,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {804#true} is VALID [2018-11-23 12:05:52,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 12:05:52,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #59#return; {804#true} is VALID [2018-11-23 12:05:52,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret6 := main(); {804#true} is VALID [2018-11-23 12:05:52,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {806#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {806#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {806#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {806#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {806#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {806#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {807#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {807#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {808#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {808#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {808#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {809#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {809#(<= main_~i~0 3)} assume !(~i~0 < 100000); {805#false} is VALID [2018-11-23 12:05:52,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {805#false} is VALID [2018-11-23 12:05:52,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {805#false} is VALID [2018-11-23 12:05:52,325 INFO L256 TraceCheckUtils]: 18: Hoare triple {805#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {805#false} is VALID [2018-11-23 12:05:52,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2018-11-23 12:05:52,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2018-11-23 12:05:52,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 12:05:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:52,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:52,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:52,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:52,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:05:52,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:52,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:05:52,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:52,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:52,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:05:53,017 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 12:05:53,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 12:05:53,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 12:05:53,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:53,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:05:53,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:53,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:53,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:53,103 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:05:53,106 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:05:53,106 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#password~0.base|, |main_~#guess~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#password~0.base|) 0)) (.cse1 (select (select |#memory_int| |main_~#guess~0.base|) 0))) (and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= |main_#t~mem4| .cse0) (= .cse0 .cse1) (= |main_#t~mem5| .cse1))) [2018-11-23 12:05:53,106 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem5| |main_#t~mem4|) [2018-11-23 12:05:53,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 12:05:53,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {804#true} is VALID [2018-11-23 12:05:53,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 12:05:53,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #59#return; {804#true} is VALID [2018-11-23 12:05:53,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret6 := main(); {804#true} is VALID [2018-11-23 12:05:53,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {828#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:05:53,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {828#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {832#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= |main_#t~mem1| (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) |main_#t~mem2|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:05:53,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= |main_#t~mem1| (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) |main_#t~mem2|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !(~i~0 < 100000); {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {864#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} is VALID [2018-11-23 12:05:53,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {864#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) |main_~#guess~0.offset|) (select (select |#memory_int| |main_~#password~0.base|) |main_~#password~0.offset|)))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {868#(= |main_#t~mem5| |main_#t~mem4|)} is VALID [2018-11-23 12:05:53,249 INFO L256 TraceCheckUtils]: 18: Hoare triple {868#(= |main_#t~mem5| |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {872#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:05:53,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {872#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {876#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:05:53,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {805#false} is VALID [2018-11-23 12:05:53,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 12:05:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:05:53,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:53,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 12:05:53,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 12:05:53,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:53,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:05:53,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:53,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:05:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:05:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:53,362 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-11-23 12:05:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,453 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-23 12:05:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:05:54,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 12:05:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 12:05:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 12:05:54,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2018-11-23 12:05:54,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:54,587 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:05:54,587 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:05:54,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:05:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 12:05:54,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:54,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 12:05:54,652 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 12:05:54,652 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 12:05:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,655 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:05:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:05:54,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:54,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:54,656 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 12:05:54,656 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 12:05:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:54,659 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:05:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:05:54,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:54,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:54,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:54,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:05:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:05:54,663 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 22 [2018-11-23 12:05:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:54,663 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:05:54,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:05:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:05:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:05:54,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:54,665 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:54,665 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:54,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash -119035408, now seen corresponding path program 1 times [2018-11-23 12:05:54,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:54,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:54,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 12:05:54,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1098#true} is VALID [2018-11-23 12:05:54,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 12:05:54,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #59#return; {1098#true} is VALID [2018-11-23 12:05:54,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret6 := main(); {1098#true} is VALID [2018-11-23 12:05:54,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1100#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1100#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1100#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {1102#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {1103#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {1103#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {1104#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1099#false} is VALID [2018-11-23 12:05:54,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {1099#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1099#false} is VALID [2018-11-23 12:05:54,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 12:05:54,818 INFO L256 TraceCheckUtils]: 21: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1098#true} is VALID [2018-11-23 12:05:54,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#true} ~cond := #in~cond; {1098#true} is VALID [2018-11-23 12:05:54,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#true} assume !(0 == ~cond); {1098#true} is VALID [2018-11-23 12:05:54,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 12:05:54,819 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1098#true} {1099#false} #63#return; {1099#false} is VALID [2018-11-23 12:05:54,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {1099#false} havoc #t~mem5;havoc #t~mem4; {1099#false} is VALID [2018-11-23 12:05:54,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {1099#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1099#false} is VALID [2018-11-23 12:05:54,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 12:05:54,821 INFO L256 TraceCheckUtils]: 29: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1099#false} is VALID [2018-11-23 12:05:54,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 12:05:54,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {1099#false} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 12:05:54,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 12:05:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:05:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:54,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:54,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:55,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 12:05:55,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1098#true} is VALID [2018-11-23 12:05:55,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 12:05:55,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #59#return; {1098#true} is VALID [2018-11-23 12:05:55,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret6 := main(); {1098#true} is VALID [2018-11-23 12:05:55,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1123#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:55,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {1123#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1123#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:55,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {1123#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1123#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:55,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {1123#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {1101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {1102#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {1103#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {1103#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {1104#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1099#false} is VALID [2018-11-23 12:05:55,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {1099#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1099#false} is VALID [2018-11-23 12:05:55,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 12:05:55,089 INFO L256 TraceCheckUtils]: 21: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1099#false} is VALID [2018-11-23 12:05:55,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 12:05:55,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {1099#false} assume !(0 == ~cond); {1099#false} is VALID [2018-11-23 12:05:55,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {1099#false} assume true; {1099#false} is VALID [2018-11-23 12:05:55,090 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1099#false} {1099#false} #63#return; {1099#false} is VALID [2018-11-23 12:05:55,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {1099#false} havoc #t~mem5;havoc #t~mem4; {1099#false} is VALID [2018-11-23 12:05:55,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {1099#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1099#false} is VALID [2018-11-23 12:05:55,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 12:05:55,091 INFO L256 TraceCheckUtils]: 29: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1099#false} is VALID [2018-11-23 12:05:55,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 12:05:55,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {1099#false} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 12:05:55,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 12:05:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:05:55,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:55,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:05:55,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:05:55,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:55,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:05:55,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:55,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:05:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:05:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:55,175 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2018-11-23 12:05:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,344 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:05:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:05:55,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:05:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 12:05:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 12:05:55,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2018-11-23 12:05:55,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:55,483 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:05:55,483 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:05:55,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:05:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 12:05:55,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:55,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:55,634 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:55,635 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 12:05:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,637 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:05:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:05:55,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,638 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 12:05:55,638 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 12:05:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,641 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:05:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:05:55,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:55,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:05:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:05:55,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2018-11-23 12:05:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:55,645 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:05:55,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:05:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:05:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:05:55,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:55,646 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:55,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:55,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1439249173, now seen corresponding path program 2 times [2018-11-23 12:05:55,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:55,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:55,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:55,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 12:05:55,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1421#true} is VALID [2018-11-23 12:05:55,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 12:05:55,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #59#return; {1421#true} is VALID [2018-11-23 12:05:55,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret6 := main(); {1421#true} is VALID [2018-11-23 12:05:55,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1423#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {1423#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1423#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {1423#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1423#(= main_~i~0 0)} is VALID [2018-11-23 12:05:55,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {1423#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:55,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:55,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {1426#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {1426#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:55,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {1427#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {1427#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:55,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {1427#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1428#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:55,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1422#false} is VALID [2018-11-23 12:05:55,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1422#false} is VALID [2018-11-23 12:05:55,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 12:05:55,824 INFO L256 TraceCheckUtils]: 24: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1421#true} is VALID [2018-11-23 12:05:55,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2018-11-23 12:05:55,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2018-11-23 12:05:55,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 12:05:55,826 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1421#true} {1422#false} #63#return; {1422#false} is VALID [2018-11-23 12:05:55,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} havoc #t~mem5;havoc #t~mem4; {1422#false} is VALID [2018-11-23 12:05:55,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1422#false} is VALID [2018-11-23 12:05:55,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 12:05:55,828 INFO L256 TraceCheckUtils]: 32: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1422#false} is VALID [2018-11-23 12:05:55,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 12:05:55,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {1422#false} assume 0 == ~cond; {1422#false} is VALID [2018-11-23 12:05:55,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 12:05:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:05:55,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:55,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:55,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:55,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:55,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:55,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:56,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 12:05:56,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1421#true} is VALID [2018-11-23 12:05:56,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 12:05:56,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #59#return; {1421#true} is VALID [2018-11-23 12:05:56,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret6 := main(); {1421#true} is VALID [2018-11-23 12:05:56,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1447#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {1447#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1447#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {1447#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1447#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:56,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {1447#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {1426#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {1426#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {1427#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {1427#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {1427#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1428#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1422#false} is VALID [2018-11-23 12:05:56,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1422#false} is VALID [2018-11-23 12:05:56,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 12:05:56,340 INFO L256 TraceCheckUtils]: 24: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1422#false} is VALID [2018-11-23 12:05:56,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 12:05:56,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {1422#false} assume !(0 == ~cond); {1422#false} is VALID [2018-11-23 12:05:56,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {1422#false} assume true; {1422#false} is VALID [2018-11-23 12:05:56,341 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1422#false} {1422#false} #63#return; {1422#false} is VALID [2018-11-23 12:05:56,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} havoc #t~mem5;havoc #t~mem4; {1422#false} is VALID [2018-11-23 12:05:56,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1422#false} is VALID [2018-11-23 12:05:56,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 12:05:56,342 INFO L256 TraceCheckUtils]: 32: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1422#false} is VALID [2018-11-23 12:05:56,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 12:05:56,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {1422#false} assume 0 == ~cond; {1422#false} is VALID [2018-11-23 12:05:56,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 12:05:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:05:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:05:56,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 12:05:56,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:56,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:05:56,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:56,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:05:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:05:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:56,410 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-11-23 12:05:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:56,647 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 12:05:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:05:56,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 12:05:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 12:05:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 12:05:56,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2018-11-23 12:05:56,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:56,844 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:05:56,844 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:05:56,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:05:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 12:05:57,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:57,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:57,072 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:57,072 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 12:05:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:57,074 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:05:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:05:57,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:57,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:57,075 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 12:05:57,075 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 12:05:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:57,077 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:05:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:05:57,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:57,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:57,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:57,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:05:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:05:57,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2018-11-23 12:05:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:05:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:05:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:05:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:05:57,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:57,081 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:57,082 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:57,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -6300720, now seen corresponding path program 3 times [2018-11-23 12:05:57,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:57,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:57,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2018-11-23 12:05:57,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1768#true} is VALID [2018-11-23 12:05:57,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 12:05:57,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #59#return; {1768#true} is VALID [2018-11-23 12:05:57,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret6 := main(); {1768#true} is VALID [2018-11-23 12:05:57,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {1768#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1770#(= main_~i~0 0)} is VALID [2018-11-23 12:05:57,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {1770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1770#(= main_~i~0 0)} is VALID [2018-11-23 12:05:57,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {1770#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1770#(= main_~i~0 0)} is VALID [2018-11-23 12:05:57,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1771#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1771#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1771#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1772#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1772#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1772#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1772#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1773#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {1773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {1773#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1773#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {1773#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1774#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {1774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {1774#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1774#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {1774#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1775#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {1775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {1775#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1775#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {1775#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1776#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {1776#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1769#false} is VALID [2018-11-23 12:05:57,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {1769#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1769#false} is VALID [2018-11-23 12:05:57,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {1769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1769#false} is VALID [2018-11-23 12:05:57,241 INFO L256 TraceCheckUtils]: 27: Hoare triple {1769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1768#true} is VALID [2018-11-23 12:05:57,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#true} ~cond := #in~cond; {1768#true} is VALID [2018-11-23 12:05:57,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#true} assume !(0 == ~cond); {1768#true} is VALID [2018-11-23 12:05:57,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 12:05:57,242 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1768#true} {1769#false} #63#return; {1769#false} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {1769#false} havoc #t~mem5;havoc #t~mem4; {1769#false} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {1769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1769#false} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {1769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1769#false} is VALID [2018-11-23 12:05:57,243 INFO L256 TraceCheckUtils]: 35: Hoare triple {1769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1769#false} is VALID [2018-11-23 12:05:57,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2018-11-23 12:05:57,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2018-11-23 12:05:57,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2018-11-23 12:05:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:05:57,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:57,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:57,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:05:57,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:57,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:57,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:05:57,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:57,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:57,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:05:59,938 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|)))) is different from true [2018-11-23 12:06:00,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 12:06:00,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 12:06:00,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:00,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:06:00,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:00,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:00,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:00,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:06:00,198 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:00,198 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#guess~0.base|, |main_~#password~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#guess~0.base|) 4)) (.cse1 (select (select |#memory_int| |main_~#password~0.base|) 4))) (and (= |main_#t~mem5| .cse0) (= |main_#t~mem4| .cse1) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= .cse0 .cse1))) [2018-11-23 12:06:00,198 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem5| |main_#t~mem4|) [2018-11-23 12:06:00,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2018-11-23 12:06:00,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1768#true} is VALID [2018-11-23 12:06:00,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 12:06:00,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #59#return; {1768#true} is VALID [2018-11-23 12:06:00,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret6 := main(); {1768#true} is VALID [2018-11-23 12:06:00,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {1768#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:00,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:00,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:00,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {1795#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1805#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {1805#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1809#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) |main_#t~mem1|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))))} is VALID [2018-11-23 12:06:00,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) |main_#t~mem1|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(~i~0 < 100000); {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1813#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,274 INFO L256 TraceCheckUtils]: 27: Hoare triple {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 12:06:00,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 12:06:00,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} assume !(0 == ~cond); {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 12:06:00,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} assume true; {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 12:06:00,290 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1866#(exists ((|v_main_~#password~0.base_BEFORE_CALL_1| Int) (|v_main_~#guess~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#password~0.base_BEFORE_CALL_1| |v_main_~#guess~0.base_BEFORE_CALL_1|))))} {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #63#return; {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} havoc #t~mem5;havoc #t~mem4; {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {1859#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1885#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:00,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {1885#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 4)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 4))) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {1889#(= |main_#t~mem5| |main_#t~mem4|)} is VALID [2018-11-23 12:06:00,294 INFO L256 TraceCheckUtils]: 35: Hoare triple {1889#(= |main_#t~mem5| |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1893#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:00,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {1893#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1897#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:06:00,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {1897#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1769#false} is VALID [2018-11-23 12:06:00,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2018-11-23 12:06:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 2 not checked. [2018-11-23 12:06:00,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:00,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-11-23 12:06:00,325 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-11-23 12:06:00,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:00,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:06:00,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:00,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:06:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:06:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=240, Unknown=1, NotChecked=32, Total=342 [2018-11-23 12:06:00,483 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 19 states. [2018-11-23 12:06:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,680 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 12:06:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:06:48,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-11-23 12:06:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-23 12:06:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-23 12:06:48,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 71 transitions. [2018-11-23 12:06:48,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:48,814 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:06:48,815 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:06:48,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=146, Invalid=613, Unknown=1, NotChecked=52, Total=812 [2018-11-23 12:06:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:06:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-23 12:06:48,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:48,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-23 12:06:48,977 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-23 12:06:48,977 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-23 12:06:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,979 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:06:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:06:48,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-23 12:06:48,980 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-23 12:06:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,982 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:06:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:06:48,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:48,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:06:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 12:06:48,985 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 39 [2018-11-23 12:06:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:48,986 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 12:06:48,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:06:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:06:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:06:48,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:48,987 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:48,987 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:48,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 155655497, now seen corresponding path program 4 times [2018-11-23 12:06:48,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:48,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:49,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {2212#true} call ULTIMATE.init(); {2212#true} is VALID [2018-11-23 12:06:49,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {2212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2212#true} is VALID [2018-11-23 12:06:49,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 12:06:49,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} #59#return; {2212#true} is VALID [2018-11-23 12:06:49,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {2212#true} call #t~ret6 := main(); {2212#true} is VALID [2018-11-23 12:06:49,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {2212#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {2214#(= main_~i~0 0)} is VALID [2018-11-23 12:06:49,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {2214#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2214#(= main_~i~0 0)} is VALID [2018-11-23 12:06:49,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {2214#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2214#(= main_~i~0 0)} is VALID [2018-11-23 12:06:49,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {2214#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {2215#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {2215#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {2216#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {2216#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {2216#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {2217#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {2217#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {2217#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {2218#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {2218#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {2218#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {2219#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {2219#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {2219#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {2220#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {2220#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {2220#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:49,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2213#false} is VALID [2018-11-23 12:06:49,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {2213#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {2213#false} is VALID [2018-11-23 12:06:49,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,229 INFO L256 TraceCheckUtils]: 30: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2212#true} is VALID [2018-11-23 12:06:49,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {2212#true} ~cond := #in~cond; {2212#true} is VALID [2018-11-23 12:06:49,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {2212#true} assume !(0 == ~cond); {2212#true} is VALID [2018-11-23 12:06:49,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 12:06:49,230 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2212#true} {2213#false} #63#return; {2213#false} is VALID [2018-11-23 12:06:49,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {2213#false} havoc #t~mem5;havoc #t~mem4; {2213#false} is VALID [2018-11-23 12:06:49,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {2213#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2213#false} is VALID [2018-11-23 12:06:49,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,231 INFO L256 TraceCheckUtils]: 38: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2212#true} is VALID [2018-11-23 12:06:49,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {2212#true} ~cond := #in~cond; {2212#true} is VALID [2018-11-23 12:06:49,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {2212#true} assume !(0 == ~cond); {2212#true} is VALID [2018-11-23 12:06:49,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 12:06:49,232 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2212#true} {2213#false} #63#return; {2213#false} is VALID [2018-11-23 12:06:49,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#false} havoc #t~mem5;havoc #t~mem4; {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {2213#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L256 TraceCheckUtils]: 46: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {2213#false} assume 0 == ~cond; {2213#false} is VALID [2018-11-23 12:06:49,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {2213#false} assume !false; {2213#false} is VALID [2018-11-23 12:06:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:06:49,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:49,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:49,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:49,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:49,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:49,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:49,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {2212#true} call ULTIMATE.init(); {2212#true} is VALID [2018-11-23 12:06:49,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {2212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2212#true} is VALID [2018-11-23 12:06:49,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 12:06:49,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} #59#return; {2212#true} is VALID [2018-11-23 12:06:49,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {2212#true} call #t~ret6 := main(); {2212#true} is VALID [2018-11-23 12:06:49,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {2212#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {2240#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:49,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {2240#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2240#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:49,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {2240#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2240#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:49,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {2240#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {2215#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {2215#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {2216#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {2216#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {2216#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {2217#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {2217#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {2217#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {2218#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {2218#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {2218#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {2219#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {2219#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {2219#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {2220#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {2220#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {2220#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:49,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2213#false} is VALID [2018-11-23 12:06:49,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {2213#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {2213#false} is VALID [2018-11-23 12:06:49,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,460 INFO L256 TraceCheckUtils]: 30: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 31: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {2213#false} assume !(0 == ~cond); {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {2213#false} assume true; {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2213#false} {2213#false} #63#return; {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {2213#false} havoc #t~mem5;havoc #t~mem4; {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {2213#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2213#false} is VALID [2018-11-23 12:06:49,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L256 TraceCheckUtils]: 38: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 39: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 40: Hoare triple {2213#false} assume !(0 == ~cond); {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {2213#false} assume true; {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2213#false} {2213#false} #63#return; {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#false} havoc #t~mem5;havoc #t~mem4; {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {2213#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2213#false} is VALID [2018-11-23 12:06:49,462 INFO L273 TraceCheckUtils]: 45: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 12:06:49,463 INFO L256 TraceCheckUtils]: 46: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2213#false} is VALID [2018-11-23 12:06:49,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 12:06:49,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {2213#false} assume 0 == ~cond; {2213#false} is VALID [2018-11-23 12:06:49,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {2213#false} assume !false; {2213#false} is VALID [2018-11-23 12:06:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:06:49,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:49,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:06:49,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-23 12:06:49,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:49,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:49,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:49,534 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2018-11-23 12:06:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,795 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 12:06:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:49,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-23 12:06:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-23 12:06:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-23 12:06:49,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2018-11-23 12:06:49,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:49,864 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:06:49,864 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:06:49,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:06:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 12:06:49,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:49,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 12:06:49,983 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 12:06:49,983 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 12:06:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,985 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:06:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:06:49,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:49,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 12:06:49,987 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 12:06:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,988 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:06:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:06:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:49,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:49,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:49,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:06:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 12:06:49,991 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-11-23 12:06:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:49,992 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 12:06:49,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:06:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:06:49,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:49,993 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:49,993 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:49,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1704878788, now seen corresponding path program 5 times [2018-11-23 12:06:49,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:49,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:50,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {2680#true} call ULTIMATE.init(); {2680#true} is VALID [2018-11-23 12:06:50,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {2680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2680#true} is VALID [2018-11-23 12:06:50,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 12:06:50,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2680#true} {2680#true} #59#return; {2680#true} is VALID [2018-11-23 12:06:50,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {2680#true} call #t~ret6 := main(); {2680#true} is VALID [2018-11-23 12:06:50,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {2680#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {2682#(= main_~i~0 0)} is VALID [2018-11-23 12:06:50,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {2682#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2682#(= main_~i~0 0)} is VALID [2018-11-23 12:06:50,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {2682#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2682#(= main_~i~0 0)} is VALID [2018-11-23 12:06:50,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {2682#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {2683#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {2683#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {2685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {2685#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {2685#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {2686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {2686#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {2686#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {2687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,276 INFO L273 TraceCheckUtils]: 22: Hoare triple {2687#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {2687#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {2688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {2688#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,279 INFO L273 TraceCheckUtils]: 26: Hoare triple {2688#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {2689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {2689#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {2689#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {2690#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2681#false} is VALID [2018-11-23 12:06:50,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {2681#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {2681#false} is VALID [2018-11-23 12:06:50,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,283 INFO L256 TraceCheckUtils]: 33: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2680#true} is VALID [2018-11-23 12:06:50,283 INFO L273 TraceCheckUtils]: 34: Hoare triple {2680#true} ~cond := #in~cond; {2680#true} is VALID [2018-11-23 12:06:50,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {2680#true} assume !(0 == ~cond); {2680#true} is VALID [2018-11-23 12:06:50,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 12:06:50,284 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2680#true} {2681#false} #63#return; {2681#false} is VALID [2018-11-23 12:06:50,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {2681#false} havoc #t~mem5;havoc #t~mem4; {2681#false} is VALID [2018-11-23 12:06:50,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {2681#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2681#false} is VALID [2018-11-23 12:06:50,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,285 INFO L256 TraceCheckUtils]: 41: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2680#true} is VALID [2018-11-23 12:06:50,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {2680#true} ~cond := #in~cond; {2680#true} is VALID [2018-11-23 12:06:50,286 INFO L273 TraceCheckUtils]: 43: Hoare triple {2680#true} assume !(0 == ~cond); {2680#true} is VALID [2018-11-23 12:06:50,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 12:06:50,286 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2680#true} {2681#false} #63#return; {2681#false} is VALID [2018-11-23 12:06:50,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {2681#false} havoc #t~mem5;havoc #t~mem4; {2681#false} is VALID [2018-11-23 12:06:50,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {2681#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2681#false} is VALID [2018-11-23 12:06:50,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,287 INFO L256 TraceCheckUtils]: 49: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2681#false} is VALID [2018-11-23 12:06:50,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 12:06:50,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {2681#false} assume 0 == ~cond; {2681#false} is VALID [2018-11-23 12:06:50,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {2681#false} assume !false; {2681#false} is VALID [2018-11-23 12:06:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:06:50,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:50,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:50,381 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 12:06:50,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:50,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:50,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {2680#true} call ULTIMATE.init(); {2680#true} is VALID [2018-11-23 12:06:50,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {2680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2680#true} is VALID [2018-11-23 12:06:50,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 12:06:50,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2680#true} {2680#true} #59#return; {2680#true} is VALID [2018-11-23 12:06:50,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {2680#true} call #t~ret6 := main(); {2680#true} is VALID [2018-11-23 12:06:50,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {2680#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {2709#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {2709#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2709#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {2709#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2709#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:50,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {2709#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {2683#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {2683#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {2685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {2685#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {2685#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {2686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {2686#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {2686#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {2687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {2687#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {2687#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {2688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {2688#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {2688#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {2689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {2689#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {2689#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {2690#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2681#false} is VALID [2018-11-23 12:06:50,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {2681#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {2681#false} is VALID [2018-11-23 12:06:50,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,693 INFO L256 TraceCheckUtils]: 33: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2681#false} is VALID [2018-11-23 12:06:50,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 12:06:50,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {2681#false} assume !(0 == ~cond); {2681#false} is VALID [2018-11-23 12:06:50,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {2681#false} assume true; {2681#false} is VALID [2018-11-23 12:06:50,694 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2681#false} {2681#false} #63#return; {2681#false} is VALID [2018-11-23 12:06:50,694 INFO L273 TraceCheckUtils]: 38: Hoare triple {2681#false} havoc #t~mem5;havoc #t~mem4; {2681#false} is VALID [2018-11-23 12:06:50,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {2681#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2681#false} is VALID [2018-11-23 12:06:50,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,695 INFO L256 TraceCheckUtils]: 41: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2681#false} is VALID [2018-11-23 12:06:50,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 12:06:50,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {2681#false} assume !(0 == ~cond); {2681#false} is VALID [2018-11-23 12:06:50,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {2681#false} assume true; {2681#false} is VALID [2018-11-23 12:06:50,696 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2681#false} {2681#false} #63#return; {2681#false} is VALID [2018-11-23 12:06:50,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {2681#false} havoc #t~mem5;havoc #t~mem4; {2681#false} is VALID [2018-11-23 12:06:50,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {2681#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2681#false} is VALID [2018-11-23 12:06:50,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 12:06:50,697 INFO L256 TraceCheckUtils]: 49: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2681#false} is VALID [2018-11-23 12:06:50,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 12:06:50,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {2681#false} assume 0 == ~cond; {2681#false} is VALID [2018-11-23 12:06:50,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {2681#false} assume !false; {2681#false} is VALID [2018-11-23 12:06:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:06:50,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:50,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:06:50,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 12:06:50,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:50,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:06:50,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:50,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:06:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:06:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:50,778 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 12 states. [2018-11-23 12:06:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,082 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 12:06:51,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:06:51,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 12:06:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:06:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:06:51,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2018-11-23 12:06:51,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:51,206 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:06:51,206 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:06:51,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:06:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:06:51,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:51,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:06:51,324 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:06:51,324 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:06:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,326 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:06:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:06:51,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:51,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:51,327 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:06:51,327 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:06:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,328 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:06:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:06:51,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:51,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:51,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:51,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:06:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:06:51,330 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-23 12:06:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:06:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:06:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:06:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:06:51,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:51,331 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:51,331 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:51,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 897378153, now seen corresponding path program 6 times [2018-11-23 12:06:51,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:51,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {3172#true} call ULTIMATE.init(); {3172#true} is VALID [2018-11-23 12:06:51,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {3172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3172#true} is VALID [2018-11-23 12:06:51,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 12:06:51,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3172#true} {3172#true} #59#return; {3172#true} is VALID [2018-11-23 12:06:51,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {3172#true} call #t~ret6 := main(); {3172#true} is VALID [2018-11-23 12:06:51,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {3172#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {3174#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {3174#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3174#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {3174#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3174#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3175#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {3175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3175#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3175#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {3175#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3176#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {3176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3176#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {3176#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3176#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {3176#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3177#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {3177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3177#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3177#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {3177#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3178#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {3178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3178#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {3178#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3178#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {3178#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3179#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {3179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3179#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3179#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {3179#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3180#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {3180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3180#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {3180#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3180#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {3180#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3181#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {3181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3181#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3181#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {3181#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3182#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {3182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3182#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {3182#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3182#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {3182#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3183#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {3183#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3173#false} is VALID [2018-11-23 12:06:51,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {3173#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {3173#false} is VALID [2018-11-23 12:06:51,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 12:06:51,571 INFO L256 TraceCheckUtils]: 36: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3172#true} is VALID [2018-11-23 12:06:51,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {3172#true} ~cond := #in~cond; {3172#true} is VALID [2018-11-23 12:06:51,571 INFO L273 TraceCheckUtils]: 38: Hoare triple {3172#true} assume !(0 == ~cond); {3172#true} is VALID [2018-11-23 12:06:51,571 INFO L273 TraceCheckUtils]: 39: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 12:06:51,572 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3172#true} {3173#false} #63#return; {3173#false} is VALID [2018-11-23 12:06:51,572 INFO L273 TraceCheckUtils]: 41: Hoare triple {3173#false} havoc #t~mem5;havoc #t~mem4; {3173#false} is VALID [2018-11-23 12:06:51,572 INFO L273 TraceCheckUtils]: 42: Hoare triple {3173#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3173#false} is VALID [2018-11-23 12:06:51,572 INFO L273 TraceCheckUtils]: 43: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 12:06:51,573 INFO L256 TraceCheckUtils]: 44: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3172#true} is VALID [2018-11-23 12:06:51,573 INFO L273 TraceCheckUtils]: 45: Hoare triple {3172#true} ~cond := #in~cond; {3172#true} is VALID [2018-11-23 12:06:51,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {3172#true} assume !(0 == ~cond); {3172#true} is VALID [2018-11-23 12:06:51,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 12:06:51,573 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3172#true} {3173#false} #63#return; {3173#false} is VALID [2018-11-23 12:06:51,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {3173#false} havoc #t~mem5;havoc #t~mem4; {3173#false} is VALID [2018-11-23 12:06:51,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {3173#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3173#false} is VALID [2018-11-23 12:06:51,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 12:06:51,574 INFO L256 TraceCheckUtils]: 52: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3173#false} is VALID [2018-11-23 12:06:51,574 INFO L273 TraceCheckUtils]: 53: Hoare triple {3173#false} ~cond := #in~cond; {3173#false} is VALID [2018-11-23 12:06:51,574 INFO L273 TraceCheckUtils]: 54: Hoare triple {3173#false} assume 0 == ~cond; {3173#false} is VALID [2018-11-23 12:06:51,574 INFO L273 TraceCheckUtils]: 55: Hoare triple {3173#false} assume !false; {3173#false} is VALID [2018-11-23 12:06:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:06:51,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:51,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:51,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 12:06:51,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:51,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:06:51,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:51,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:51,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:06:54,134 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|)))) is different from true [2018-11-23 12:06:56,324 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|)))) is different from true [2018-11-23 12:06:56,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 12:06:56,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 12:06:56,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:56,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:06:56,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:56,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:56,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:56,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:06:56,633 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:56,633 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#password~0.base|, |main_~#guess~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#password~0.base|) 8)) (.cse1 (select (select |#memory_int| |main_~#guess~0.base|) 8))) (and (= .cse0 |main_#t~mem4|) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= .cse1 |main_#t~mem5|) (= .cse0 .cse1))) [2018-11-23 12:06:56,633 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem5| |main_#t~mem4|) [2018-11-23 12:06:56,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {3172#true} call ULTIMATE.init(); {3172#true} is VALID [2018-11-23 12:06:56,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {3172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3172#true} is VALID [2018-11-23 12:06:56,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 12:06:56,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3172#true} {3172#true} #59#return; {3172#true} is VALID [2018-11-23 12:06:56,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {3172#true} call #t~ret6 := main(); {3172#true} is VALID [2018-11-23 12:06:56,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {3172#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:56,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:56,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:06:56,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {3202#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:56,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:56,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:56,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {3212#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3222#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:56,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {3222#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3226#(and (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) |main_#t~mem1|) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8)) |main_#t~mem2|) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:06:56,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {3226#(and (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) |main_#t~mem1|) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8)) |main_#t~mem2|) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !(~i~0 < 100000); {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {3230#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,735 INFO L256 TraceCheckUtils]: 36: Hoare triple {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} is VALID [2018-11-23 12:06:56,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} ~cond := #in~cond; {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} is VALID [2018-11-23 12:06:56,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} assume !(0 == ~cond); {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} is VALID [2018-11-23 12:06:56,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} assume true; {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} is VALID [2018-11-23 12:06:56,763 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3301#(exists ((|v_main_~#password~0.base_BEFORE_CALL_2| Int) (|v_main_~#guess~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_2|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_2| |v_main_~#guess~0.base_BEFORE_CALL_2|))))} {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #63#return; {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} havoc #t~mem5;havoc #t~mem4; {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {3294#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,767 INFO L256 TraceCheckUtils]: 44: Hoare triple {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 12:06:56,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} ~cond := #in~cond; {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 12:06:56,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} assume !(0 == ~cond); {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 12:06:56,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} assume true; {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 12:06:56,788 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3327#(exists ((|v_main_~#password~0.base_BEFORE_CALL_3| Int) (|v_main_~#guess~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#password~0.base_BEFORE_CALL_3| |v_main_~#guess~0.base_BEFORE_CALL_3|))))} {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #63#return; {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,800 INFO L273 TraceCheckUtils]: 49: Hoare triple {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} havoc #t~mem5;havoc #t~mem4; {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {3320#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3346#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} is VALID [2018-11-23 12:06:56,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {3346#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 8)) (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 8))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3350#(= |main_#t~mem5| |main_#t~mem4|)} is VALID [2018-11-23 12:06:56,802 INFO L256 TraceCheckUtils]: 52: Hoare triple {3350#(= |main_#t~mem5| |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3354#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:56,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {3354#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3358#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:06:56,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {3358#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3173#false} is VALID [2018-11-23 12:06:56,803 INFO L273 TraceCheckUtils]: 55: Hoare triple {3173#false} assume !false; {3173#false} is VALID [2018-11-23 12:06:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 57 trivial. 8 not checked. [2018-11-23 12:06:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-11-23 12:06:56,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 12:06:56,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:56,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:06:56,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:56,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:06:56,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:06:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=393, Unknown=2, NotChecked=86, Total=600 [2018-11-23 12:06:56,950 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2018-11-23 12:08:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:43,499 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:08:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:08:43,500 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 12:08:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 12:08:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 12:08:43,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 88 transitions. [2018-11-23 12:08:43,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:43,621 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:08:43,621 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:08:43,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=232, Invalid=964, Unknown=2, NotChecked=134, Total=1332 [2018-11-23 12:08:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:08:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-23 12:08:43,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:43,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2018-11-23 12:08:43,879 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2018-11-23 12:08:43,879 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2018-11-23 12:08:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:43,881 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-23 12:08:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 12:08:43,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:43,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:43,882 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2018-11-23 12:08:43,882 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2018-11-23 12:08:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:43,884 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-23 12:08:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 12:08:43,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:43,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:43,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:43,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:08:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-23 12:08:43,887 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 56 [2018-11-23 12:08:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:43,887 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-23 12:08:43,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:08:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 12:08:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:08:43,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:43,888 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:43,888 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:43,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1078062520, now seen corresponding path program 7 times [2018-11-23 12:08:43,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:43,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {3768#true} call ULTIMATE.init(); {3768#true} is VALID [2018-11-23 12:08:44,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {3768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3768#true} is VALID [2018-11-23 12:08:44,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:08:44,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3768#true} {3768#true} #59#return; {3768#true} is VALID [2018-11-23 12:08:44,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {3768#true} call #t~ret6 := main(); {3768#true} is VALID [2018-11-23 12:08:44,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {3768#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:08:44,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {3770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:08:44,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {3770#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:08:44,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {3770#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {3771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {3771#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {3772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {3772#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {3773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {3773#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {3774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {3774#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {3774#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {3775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {3775#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {3775#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {3776#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {3776#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {3777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {3777#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {3777#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {3778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {3778#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {3778#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {3779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,210 INFO L273 TraceCheckUtils]: 34: Hoare triple {3779#(<= main_~i~0 9)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {3779#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3780#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:44,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {3780#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3769#false} is VALID [2018-11-23 12:08:44,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {3769#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {3769#false} is VALID [2018-11-23 12:08:44,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,212 INFO L256 TraceCheckUtils]: 39: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:08:44,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:08:44,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:08:44,213 INFO L273 TraceCheckUtils]: 42: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:08:44,213 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3768#true} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,214 INFO L273 TraceCheckUtils]: 46: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,214 INFO L256 TraceCheckUtils]: 47: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:08:44,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:08:44,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:08:44,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:08:44,215 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3768#true} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,215 INFO L273 TraceCheckUtils]: 52: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,215 INFO L273 TraceCheckUtils]: 53: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,216 INFO L256 TraceCheckUtils]: 55: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:08:44,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:08:44,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:08:44,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:08:44,216 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3768#true} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L273 TraceCheckUtils]: 60: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L273 TraceCheckUtils]: 61: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L273 TraceCheckUtils]: 62: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L256 TraceCheckUtils]: 63: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L273 TraceCheckUtils]: 64: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:08:44,217 INFO L273 TraceCheckUtils]: 65: Hoare triple {3769#false} assume 0 == ~cond; {3769#false} is VALID [2018-11-23 12:08:44,218 INFO L273 TraceCheckUtils]: 66: Hoare triple {3769#false} assume !false; {3769#false} is VALID [2018-11-23 12:08:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 145 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:08:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:44,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:44,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {3768#true} call ULTIMATE.init(); {3768#true} is VALID [2018-11-23 12:08:44,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {3768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3768#true} is VALID [2018-11-23 12:08:44,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:08:44,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3768#true} {3768#true} #59#return; {3768#true} is VALID [2018-11-23 12:08:44,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {3768#true} call #t~ret6 := main(); {3768#true} is VALID [2018-11-23 12:08:44,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {3768#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:44,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {3799#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:44,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {3799#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:44,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {3799#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {3771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {3771#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {3772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {3772#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {3773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {3773#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {3774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {3774#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {3774#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {3775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {3775#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {3775#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {3776#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {3776#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {3777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {3777#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {3777#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {3778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {3778#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {3778#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {3779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {3779#(<= main_~i~0 9)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {3779#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3780#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:44,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {3780#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3769#false} is VALID [2018-11-23 12:08:44,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {3769#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {3769#false} is VALID [2018-11-23 12:08:44,562 INFO L273 TraceCheckUtils]: 38: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,562 INFO L256 TraceCheckUtils]: 39: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:08:44,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:08:44,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:08:44,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:08:44,563 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3769#false} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,564 INFO L256 TraceCheckUtils]: 47: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:08:44,564 INFO L273 TraceCheckUtils]: 48: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:08:44,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:08:44,564 INFO L273 TraceCheckUtils]: 50: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:08:44,565 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3769#false} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,565 INFO L273 TraceCheckUtils]: 52: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,565 INFO L273 TraceCheckUtils]: 53: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,565 INFO L273 TraceCheckUtils]: 54: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,565 INFO L256 TraceCheckUtils]: 55: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 57: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 58: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3769#false} {3769#false} #63#return; {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 60: Hoare triple {3769#false} havoc #t~mem5;havoc #t~mem4; {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {3769#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L273 TraceCheckUtils]: 62: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:08:44,566 INFO L256 TraceCheckUtils]: 63: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:08:44,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:08:44,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {3769#false} assume 0 == ~cond; {3769#false} is VALID [2018-11-23 12:08:44,567 INFO L273 TraceCheckUtils]: 66: Hoare triple {3769#false} assume !false; {3769#false} is VALID [2018-11-23 12:08:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:08:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:44,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:08:44,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:08:44,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:44,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:08:44,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:44,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:08:44,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:08:44,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:44,648 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 14 states. [2018-11-23 12:08:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:44,944 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-23 12:08:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:08:44,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:08:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2018-11-23 12:08:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2018-11-23 12:08:44,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2018-11-23 12:08:45,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:45,018 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:08:45,018 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:08:45,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:08:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 12:08:45,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:45,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2018-11-23 12:08:45,259 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2018-11-23 12:08:45,260 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2018-11-23 12:08:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,262 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:08:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:08:45,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:45,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:45,263 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2018-11-23 12:08:45,263 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2018-11-23 12:08:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,265 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:08:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:08:45,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:45,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:45,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:45,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:08:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-11-23 12:08:45,267 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2018-11-23 12:08:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:45,268 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-11-23 12:08:45,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:08:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-23 12:08:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:08:45,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:45,269 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:45,269 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:45,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 13954461, now seen corresponding path program 8 times [2018-11-23 12:08:45,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:45,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:45,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:45,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-23 12:08:45,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4381#true} is VALID [2018-11-23 12:08:45,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:08:45,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #59#return; {4381#true} is VALID [2018-11-23 12:08:45,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret6 := main(); {4381#true} is VALID [2018-11-23 12:08:45,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:08:45,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {4383#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:08:45,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {4383#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:08:45,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {4383#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {4386#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {4386#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {4387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {4387#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {4387#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {4388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {4388#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {4388#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {4389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {4389#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {4389#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {4390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {4390#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {4390#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {4391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {4391#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {4391#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {4392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {4392#(<= main_~i~0 9)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {4392#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#(<= main_~i~0 10)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4394#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:45,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {4394#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4382#false} is VALID [2018-11-23 12:08:45,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {4382#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {4382#false} is VALID [2018-11-23 12:08:45,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,515 INFO L256 TraceCheckUtils]: 42: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:08:45,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:08:45,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:08:45,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:08:45,516 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4381#true} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,517 INFO L273 TraceCheckUtils]: 49: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,517 INFO L256 TraceCheckUtils]: 50: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:08:45,517 INFO L273 TraceCheckUtils]: 51: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:08:45,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:08:45,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:08:45,518 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4381#true} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,518 INFO L273 TraceCheckUtils]: 57: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,518 INFO L256 TraceCheckUtils]: 58: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 60: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 61: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:08:45,519 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4381#true} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 63: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 64: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,519 INFO L273 TraceCheckUtils]: 65: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,520 INFO L256 TraceCheckUtils]: 66: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:08:45,520 INFO L273 TraceCheckUtils]: 67: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:08:45,520 INFO L273 TraceCheckUtils]: 68: Hoare triple {4382#false} assume 0 == ~cond; {4382#false} is VALID [2018-11-23 12:08:45,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-23 12:08:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 6 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:08:45,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:45,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:45,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:45,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:45,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:45,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:45,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-23 12:08:45,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4381#true} is VALID [2018-11-23 12:08:45,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:08:45,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #59#return; {4381#true} is VALID [2018-11-23 12:08:45,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret6 := main(); {4381#true} is VALID [2018-11-23 12:08:45,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:45,775 INFO L273 TraceCheckUtils]: 6: Hoare triple {4413#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:45,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {4413#(<= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:45,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {4413#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {4386#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {4386#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {4387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {4387#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {4387#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {4388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {4388#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {4388#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {4389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {4389#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {4389#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {4390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {4390#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {4390#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {4391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {4391#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {4391#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {4392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {4392#(<= main_~i~0 9)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {4392#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#(<= main_~i~0 10)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4394#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:45,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {4394#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4382#false} is VALID [2018-11-23 12:08:45,796 INFO L273 TraceCheckUtils]: 40: Hoare triple {4382#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {4382#false} is VALID [2018-11-23 12:08:45,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,796 INFO L256 TraceCheckUtils]: 42: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:08:45,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:08:45,797 INFO L273 TraceCheckUtils]: 44: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:08:45,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:08:45,797 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4382#false} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,797 INFO L273 TraceCheckUtils]: 47: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,797 INFO L273 TraceCheckUtils]: 48: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,798 INFO L273 TraceCheckUtils]: 49: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,798 INFO L256 TraceCheckUtils]: 50: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:08:45,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:08:45,798 INFO L273 TraceCheckUtils]: 52: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:08:45,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4382#false} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L273 TraceCheckUtils]: 57: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L256 TraceCheckUtils]: 58: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:08:45,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4382#false} {4382#false} #63#return; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 63: Hoare triple {4382#false} havoc #t~mem5;havoc #t~mem4; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {4382#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L256 TraceCheckUtils]: 66: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 67: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 68: Hoare triple {4382#false} assume 0 == ~cond; {4382#false} is VALID [2018-11-23 12:08:45,800 INFO L273 TraceCheckUtils]: 69: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-23 12:08:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:08:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:08:45,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:08:45,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:45,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:08:45,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:45,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:08:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:08:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:45,883 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 15 states. [2018-11-23 12:08:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:46,283 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-23 12:08:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:08:46,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:08:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2018-11-23 12:08:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2018-11-23 12:08:46,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2018-11-23 12:08:47,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:47,114 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:08:47,114 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:08:47,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:08:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 12:08:47,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:47,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 12:08:47,272 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 12:08:47,272 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 12:08:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,275 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 12:08:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 12:08:47,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,276 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 12:08:47,276 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 12:08:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,278 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 12:08:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 12:08:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:47,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:08:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-23 12:08:47,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2018-11-23 12:08:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:47,281 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-23 12:08:47,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:08:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-23 12:08:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:08:47,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:47,282 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:47,282 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:47,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 324380568, now seen corresponding path program 9 times [2018-11-23 12:08:47,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:47,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {5018#true} call ULTIMATE.init(); {5018#true} is VALID [2018-11-23 12:08:47,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {5018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5018#true} is VALID [2018-11-23 12:08:47,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:08:47,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5018#true} {5018#true} #59#return; {5018#true} is VALID [2018-11-23 12:08:47,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {5018#true} call #t~ret6 := main(); {5018#true} is VALID [2018-11-23 12:08:47,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {5018#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:08:47,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {5020#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:08:47,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {5020#(= main_~i~0 0)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:08:47,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {5020#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:47,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {5021#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:47,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {5021#(<= main_~i~0 1)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:47,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {5021#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:47,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {5022#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:47,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {5022#(<= main_~i~0 2)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:47,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {5022#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:47,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {5023#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:47,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {5023#(<= main_~i~0 3)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:47,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {5023#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:47,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {5024#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:47,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {5024#(<= main_~i~0 4)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:47,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {5024#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:47,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {5025#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:47,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {5025#(<= main_~i~0 5)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:47,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {5025#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:47,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {5026#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:47,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= main_~i~0 6)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:47,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {5026#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:47,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {5027#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:47,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {5027#(<= main_~i~0 7)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:47,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {5027#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:47,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {5028#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:47,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {5028#(<= main_~i~0 8)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:47,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {5028#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:47,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {5029#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:47,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {5029#(<= main_~i~0 9)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:47,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {5029#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:47,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {5030#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:47,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {5030#(<= main_~i~0 10)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:47,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {5030#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:47,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {5031#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:47,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {5031#(<= main_~i~0 11)} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:47,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {5031#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5032#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:47,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {5032#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5019#false} is VALID [2018-11-23 12:08:47,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {5019#false} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {5019#false} is VALID [2018-11-23 12:08:47,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:08:47,888 INFO L256 TraceCheckUtils]: 45: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:08:47,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:08:47,888 INFO L273 TraceCheckUtils]: 47: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:08:47,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:08:47,889 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5018#true} {5019#false} #63#return; {5019#false} is VALID [2018-11-23 12:08:47,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {5019#false} havoc #t~mem5;havoc #t~mem4; {5019#false} is VALID [2018-11-23 12:08:47,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {5019#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5019#false} is VALID [2018-11-23 12:08:47,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:08:47,889 INFO L256 TraceCheckUtils]: 53: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:08:47,890 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5018#true} {5019#false} #63#return; {5019#false} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 58: Hoare triple {5019#false} havoc #t~mem5;havoc #t~mem4; {5019#false} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 59: Hoare triple {5019#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5019#false} is VALID [2018-11-23 12:08:47,890 INFO L273 TraceCheckUtils]: 60: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:08:47,891 INFO L256 TraceCheckUtils]: 61: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 64: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:08:47,891 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5018#true} {5019#false} #63#return; {5019#false} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {5019#false} havoc #t~mem5;havoc #t~mem4; {5019#false} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {5019#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5019#false} is VALID [2018-11-23 12:08:47,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:08:47,892 INFO L256 TraceCheckUtils]: 69: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5019#false} is VALID [2018-11-23 12:08:47,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {5019#false} ~cond := #in~cond; {5019#false} is VALID [2018-11-23 12:08:47,892 INFO L273 TraceCheckUtils]: 71: Hoare triple {5019#false} assume 0 == ~cond; {5019#false} is VALID [2018-11-23 12:08:47,892 INFO L273 TraceCheckUtils]: 72: Hoare triple {5019#false} assume !false; {5019#false} is VALID [2018-11-23 12:08:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:08:47,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:47,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:47,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:47,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:08:47,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:47,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:48,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:08:48,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:48,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:48,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:08:50,381 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12)))) is different from true [2018-11-23 12:08:52,533 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12)))) is different from true [2018-11-23 12:08:54,700 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |c_#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |c_#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|)))) is different from true [2018-11-23 12:08:54,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 12:08:54,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 12:08:54,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:54,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:08:54,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:54,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:54,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:54,851 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:08:54,853 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:08:54,854 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#guess~0.base|, |main_~#password~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#guess~0.base|) 12)) (.cse1 (select (select |#memory_int| |main_~#password~0.base|) 12))) (and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= .cse0 |main_#t~mem5|) (= .cse1 |main_#t~mem4|) (= .cse0 .cse1))) [2018-11-23 12:08:54,854 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem5| |main_#t~mem4|) [2018-11-23 12:08:54,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {5018#true} call ULTIMATE.init(); {5018#true} is VALID [2018-11-23 12:08:54,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {5018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5018#true} is VALID [2018-11-23 12:08:54,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:08:54,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5018#true} {5018#true} #59#return; {5018#true} is VALID [2018-11-23 12:08:54,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {5018#true} call #t~ret6 := main(); {5018#true} is VALID [2018-11-23 12:08:54,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {5018#true} call ~#password~0.base, ~#password~0.offset := #Ultimate.alloc(400000);call ~#guess~0.base, ~#guess~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~result~0 := 1;~i~0 := 0; {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:08:54,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:08:54,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:08:54,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {5051#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {5061#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= main_~i~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {5071#(and (= main_~i~0 2) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5081#(and (= main_~i~0 3) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} is VALID [2018-11-23 12:08:54,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {5081#(and (= main_~i~0 3) (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5085#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) |main_#t~mem2|) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12)) |main_#t~mem1|))} is VALID [2018-11-23 12:08:54,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {5085#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) |main_#t~mem2|) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12)) |main_#t~mem1|))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,932 INFO L273 TraceCheckUtils]: 30: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,935 INFO L273 TraceCheckUtils]: 34: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~i~0, 4); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,941 INFO L273 TraceCheckUtils]: 40: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(#t~mem1 != #t~mem2);havoc #t~mem2;havoc #t~mem1; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,942 INFO L273 TraceCheckUtils]: 42: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !(~i~0 < 100000); {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {5089#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 1 main_~result~0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume 0 != ~result~0;havoc ~x~0;~x~0 := 0; {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,944 INFO L273 TraceCheckUtils]: 44: Hoare triple {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,946 INFO L256 TraceCheckUtils]: 45: Hoare triple {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:08:54,947 INFO L273 TraceCheckUtils]: 46: Hoare triple {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} ~cond := #in~cond; {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:08:54,947 INFO L273 TraceCheckUtils]: 47: Hoare triple {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} assume !(0 == ~cond); {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:08:54,948 INFO L273 TraceCheckUtils]: 48: Hoare triple {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} assume true; {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:08:54,948 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5178#(exists ((|v_main_~#password~0.base_BEFORE_CALL_4| Int) (|v_main_~#guess~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_4| |v_main_~#guess~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_4|) 12))))} {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #63#return; {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,949 INFO L273 TraceCheckUtils]: 50: Hoare triple {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} havoc #t~mem5;havoc #t~mem4; {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {5171#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 0) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,950 INFO L273 TraceCheckUtils]: 52: Hoare triple {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,952 INFO L256 TraceCheckUtils]: 53: Hoare triple {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} is VALID [2018-11-23 12:08:54,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} ~cond := #in~cond; {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} is VALID [2018-11-23 12:08:54,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} assume !(0 == ~cond); {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} is VALID [2018-11-23 12:08:54,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} assume true; {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} is VALID [2018-11-23 12:08:54,955 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5204#(exists ((|v_main_~#password~0.base_BEFORE_CALL_5| Int) (|v_main_~#guess~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#password~0.base_BEFORE_CALL_5| |v_main_~#guess~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_5|) 12))))} {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #63#return; {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,956 INFO L273 TraceCheckUtils]: 58: Hoare triple {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} havoc #t~mem5;havoc #t~mem4; {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {5197#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 1) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,958 INFO L273 TraceCheckUtils]: 60: Hoare triple {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,960 INFO L256 TraceCheckUtils]: 61: Hoare triple {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} is VALID [2018-11-23 12:08:54,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} ~cond := #in~cond; {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} is VALID [2018-11-23 12:08:54,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} assume !(0 == ~cond); {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} is VALID [2018-11-23 12:08:54,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} assume true; {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} is VALID [2018-11-23 12:08:54,963 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5230#(exists ((|v_main_~#password~0.base_BEFORE_CALL_6| Int) (|v_main_~#guess~0.base_BEFORE_CALL_6| Int)) (and (= (select (select |#memory_int| |v_main_~#guess~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#password~0.base_BEFORE_CALL_6|) 12)) (not (= |v_main_~#password~0.base_BEFORE_CALL_6| |v_main_~#guess~0.base_BEFORE_CALL_6|))))} {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #63#return; {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,964 INFO L273 TraceCheckUtils]: 66: Hoare triple {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} havoc #t~mem5;havoc #t~mem4; {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,965 INFO L273 TraceCheckUtils]: 67: Hoare triple {5223#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= main_~x~0 2) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5249#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~x~0 3) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} is VALID [2018-11-23 12:08:54,966 INFO L273 TraceCheckUtils]: 68: Hoare triple {5249#(and (not (= |main_~#password~0.base| |main_~#guess~0.base|)) (= 0 |main_~#password~0.offset|) (= 0 |main_~#guess~0.offset|) (= main_~x~0 3) (= (select (select |#memory_int| |main_~#guess~0.base|) (+ |main_~#guess~0.offset| 12)) (select (select |#memory_int| |main_~#password~0.base|) (+ |main_~#password~0.offset| 12))))} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#password~0.base, ~#password~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#guess~0.base, ~#guess~0.offset + 4 * ~x~0, 4); {5253#(= |main_#t~mem5| |main_#t~mem4|)} is VALID [2018-11-23 12:08:54,967 INFO L256 TraceCheckUtils]: 69: Hoare triple {5253#(= |main_#t~mem5| |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5257#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:08:54,967 INFO L273 TraceCheckUtils]: 70: Hoare triple {5257#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5261#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:08:54,968 INFO L273 TraceCheckUtils]: 71: Hoare triple {5261#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5019#false} is VALID [2018-11-23 12:08:54,968 INFO L273 TraceCheckUtils]: 72: Hoare triple {5019#false} assume !false; {5019#false} is VALID [2018-11-23 12:08:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 18 not checked. [2018-11-23 12:08:55,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-11-23 12:08:55,014 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2018-11-23 12:08:55,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:55,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:08:55,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:55,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:08:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:08:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=582, Unknown=3, NotChecked=162, Total=930 [2018-11-23 12:08:55,132 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 31 states.