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/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:25,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:25,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:25,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:25,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:25,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:25,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:25,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:25,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:25,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:25,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:25,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:25,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:25,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:25,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:25,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:25,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:25,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:25,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:25,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:25,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:25,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:25,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:25,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:25,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:25,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:25,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:25,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:25,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:25,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:25,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:25,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:25,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:25,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:25,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:25,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:25,660 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 13:03:25,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:25,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:25,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:25,686 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:25,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:25,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:25,687 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:25,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:25,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:25,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:25,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:25,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:25,689 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:25,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:25,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:25,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:25,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:25,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:25,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:25,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:25,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:25,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:25,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:25,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:25,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:25,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:25,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:25,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:25,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:25,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:25,763 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:25,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-23 13:03:25,845 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1611abfb/5c37032b632948118a71f1a391537906/FLAG28769be96 [2018-11-23 13:03:26,254 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:26,255 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-23 13:03:26,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1611abfb/5c37032b632948118a71f1a391537906/FLAG28769be96 [2018-11-23 13:03:26,647 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1611abfb/5c37032b632948118a71f1a391537906 [2018-11-23 13:03:26,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:26,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:26,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:26,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:26,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:26,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:26" (1/1) ... [2018-11-23 13:03:26,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5417f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:26, skipping insertion in model container [2018-11-23 13:03:26,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:26" (1/1) ... [2018-11-23 13:03:26,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:26,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:26,969 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:26,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:27,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:27,030 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:27,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27 WrapperNode [2018-11-23 13:03:27,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:27,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:27,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:27,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:27,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:27,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:27,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:27,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:27,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:27,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:27,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:27,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:27,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (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 13:03:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:27,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:27,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:27,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:27,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:27,865 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:03:27,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:27 BoogieIcfgContainer [2018-11-23 13:03:27,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:27,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:27,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:27,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:27,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:26" (1/3) ... [2018-11-23 13:03:27,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381a423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:27, skipping insertion in model container [2018-11-23 13:03:27,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (2/3) ... [2018-11-23 13:03:27,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381a423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:27, skipping insertion in model container [2018-11-23 13:03:27,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:27" (3/3) ... [2018-11-23 13:03:27,874 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-23 13:03:27,882 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:27,889 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:27,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:27,936 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:27,937 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:27,937 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:27,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:27,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:27,938 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:27,938 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:27,938 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:27,938 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 13:03:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:03:27,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:27,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:27,966 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:27,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 13:03:27,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:27,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 13:03:28,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 13:03:28,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 13:03:28,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 13:03:28,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret9 := main(); {30#true} is VALID [2018-11-23 13:03:28,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {30#true} is VALID [2018-11-23 13:03:28,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 13:03:28,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {31#false} is VALID [2018-11-23 13:03:28,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 >= 0); {31#false} is VALID [2018-11-23 13:03:28,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {31#false} is VALID [2018-11-23 13:03:28,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {31#false} is VALID [2018-11-23 13:03:28,140 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {31#false} is VALID [2018-11-23 13:03:28,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 13:03:28,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 13:03:28,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 13:03:28,148 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 13:03:28,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:28,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:28,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 13:03:28,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:28,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:28,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:28,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:28,324 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 13:03:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:28,797 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 13:03:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:28,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 13:03:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 13:03:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 13:03:28,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 13:03:29,091 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 13:03:29,102 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:03:29,103 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:03:29,106 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 13:03:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:03:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:03:29,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:29,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:03:29,151 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:03:29,151 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:03:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,156 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:03:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:03:29,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:29,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:29,157 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:03:29,157 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:03:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,161 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:03:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:03:29,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:29,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:29,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:29,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:03:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 13:03:29,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 13:03:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:29,167 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 13:03:29,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:03:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:03:29,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:29,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:29,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:29,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 13:03:29,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:29,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:29,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:29,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 13:03:29,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-23 13:03:29,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 13:03:29,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-23 13:03:29,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret9 := main(); {168#true} is VALID [2018-11-23 13:03:29,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {170#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} is VALID [2018-11-23 13:03:29,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {170#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} is VALID [2018-11-23 13:03:29,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {170#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {171#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= 0 main_~i~0))} is VALID [2018-11-23 13:03:29,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {171#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {169#false} is VALID [2018-11-23 13:03:29,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {169#false} is VALID [2018-11-23 13:03:29,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {169#false} is VALID [2018-11-23 13:03:29,685 INFO L256 TraceCheckUtils]: 11: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {169#false} is VALID [2018-11-23 13:03:29,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-23 13:03:29,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2018-11-23 13:03:29,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 13:03:29,688 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 13:03:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:29,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:29,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:03:29,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:29,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:03:29,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:29,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:29,726 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-11-23 13:03:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,277 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:03:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:30,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:03:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:03:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 13:03:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:03:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 13:03:30,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2018-11-23 13:03:30,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:30,354 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:03:30,354 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:03:30,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:03:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:03:30,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:30,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:30,386 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:30,386 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,390 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:03:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:03:30,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,391 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:30,391 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,394 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:03:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:03:30,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:30,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:03:30,397 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 13:03:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:30,398 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:03:30,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:03:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:30,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:30,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:30,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:30,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-23 13:03:30,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:30,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:30,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {302#true} is VALID [2018-11-23 13:03:30,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {302#true} is VALID [2018-11-23 13:03:30,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2018-11-23 13:03:30,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #63#return; {302#true} is VALID [2018-11-23 13:03:30,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret9 := main(); {302#true} is VALID [2018-11-23 13:03:30,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {302#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {304#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:30,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {304#(and (<= main_~max~0 5) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {304#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:30,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {304#(and (<= main_~max~0 5) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {305#(and (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:30,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(and (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {305#(and (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:30,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#(and (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {306#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:30,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {303#false} is VALID [2018-11-23 13:03:30,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {303#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {303#false} is VALID [2018-11-23 13:03:30,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {303#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {303#false} is VALID [2018-11-23 13:03:30,819 INFO L256 TraceCheckUtils]: 13: Hoare triple {303#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {303#false} is VALID [2018-11-23 13:03:30,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {303#false} ~cond := #in~cond; {303#false} is VALID [2018-11-23 13:03:30,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {303#false} assume 0 == ~cond; {303#false} is VALID [2018-11-23 13:03:30,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {303#false} assume !false; {303#false} is VALID [2018-11-23 13:03:30,822 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 13:03:30,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:30,823 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 13:03:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:30,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:31,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {302#true} is VALID [2018-11-23 13:03:31,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {302#true} is VALID [2018-11-23 13:03:31,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2018-11-23 13:03:31,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #63#return; {302#true} is VALID [2018-11-23 13:03:31,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret9 := main(); {302#true} is VALID [2018-11-23 13:03:31,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {302#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {325#(= main_~i~0 0)} is VALID [2018-11-23 13:03:31,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {329#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-23 13:03:31,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {329#(<= (mod main_~max~0 4294967296) 0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {329#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-23 13:03:31,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {329#(<= (mod main_~max~0 4294967296) 0)} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {329#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-23 13:03:31,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(<= (mod main_~max~0 4294967296) 0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {329#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-23 13:03:31,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#(<= (mod main_~max~0 4294967296) 0)} assume !(~i~0 >= 0); {329#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-23 13:03:31,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#(<= (mod main_~max~0 4294967296) 0)} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {345#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:31,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {345#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {303#false} is VALID [2018-11-23 13:03:31,045 INFO L256 TraceCheckUtils]: 13: Hoare triple {303#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {303#false} is VALID [2018-11-23 13:03:31,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {303#false} ~cond := #in~cond; {303#false} is VALID [2018-11-23 13:03:31,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {303#false} assume 0 == ~cond; {303#false} is VALID [2018-11-23 13:03:31,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {303#false} assume !false; {303#false} is VALID [2018-11-23 13:03:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 13:03:31,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:03:31,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:31,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:31,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:31,170 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2018-11-23 13:03:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,807 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 13:03:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:31,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:03:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 13:03:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 13:03:31,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 13:03:32,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:32,032 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:03:32,032 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:03:32,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:03:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 13:03:32,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:32,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:32,126 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:32,126 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:32,131 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:03:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:03:32,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:32,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:32,132 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 13:03:32,132 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 13:03:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:32,135 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:03:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:03:32,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:32,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:32,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:32,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:03:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 13:03:32,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-11-23 13:03:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:32,139 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:03:32,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:03:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:03:32,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:32,140 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:32,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 515736960, now seen corresponding path program 1 times [2018-11-23 13:03:32,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:32,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2018-11-23 13:03:32,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {534#true} is VALID [2018-11-23 13:03:32,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2018-11-23 13:03:32,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #63#return; {534#true} is VALID [2018-11-23 13:03:32,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret9 := main(); {534#true} is VALID [2018-11-23 13:03:32,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {534#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:32,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {536#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {537#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:32,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {537#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:32,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {538#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-23 13:03:32,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {539#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:32,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {540#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {540#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {535#false} is VALID [2018-11-23 13:03:32,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {535#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {535#false} is VALID [2018-11-23 13:03:32,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {535#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {535#false} is VALID [2018-11-23 13:03:32,496 INFO L256 TraceCheckUtils]: 17: Hoare triple {535#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {535#false} is VALID [2018-11-23 13:03:32,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2018-11-23 13:03:32,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2018-11-23 13:03:32,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {535#false} assume !false; {535#false} is VALID [2018-11-23 13:03:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:32,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:32,501 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 13:03:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:32,696 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 13:03:32,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:32,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:32,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-23 13:03:33,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 13:03:33,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:03:33,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,224 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:33,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,255 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-23 13:03:33,994 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 40 treesize of output 36 [2018-11-23 13:03:34,000 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:34,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 13:03:34,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,020 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:34,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:03:34,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,046 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-23 13:03:34,051 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:34,051 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, v_prenex_1, |main_~#str2~0.offset|, |main_~#str1~0.base|]. (let ((.cse1 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|)) (.cse0 (mod (+ v_prenex_1 4294967295) 4294967296))) (and (<= .cse0 2147483647) (= (select .cse1 (+ .cse0 |main_~#str2~0.offset|)) |main_#t~mem7|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 .cse0) (= |main_#t~mem6| (select .cse2 0)) (<= .cse0 1) (= (select .cse1 (+ |main_~#str2~0.offset| 1)) (select .cse2 (+ .cse0 (- 1)))))) [2018-11-23 13:03:34,052 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 13:03:34,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2018-11-23 13:03:34,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {534#true} is VALID [2018-11-23 13:03:34,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2018-11-23 13:03:34,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #63#return; {534#true} is VALID [2018-11-23 13:03:34,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret9 := main(); {534#true} is VALID [2018-11-23 13:03:34,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {534#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:34,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:34,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:34,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:34,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {559#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {572#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:34,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {572#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {576#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-23 13:03:34,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {580#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:34,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {580#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {584#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:34,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {588#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:34,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {592#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 1) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:34,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {592#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 1) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {596#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} is VALID [2018-11-23 13:03:34,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {596#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {600#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:03:34,174 INFO L256 TraceCheckUtils]: 17: Hoare triple {600#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {604#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:34,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {604#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {608#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:03:34,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {608#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {535#false} is VALID [2018-11-23 13:03:34,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {535#false} assume !false; {535#false} is VALID [2018-11-23 13:03:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:34,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-11-23 13:03:34,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-11-23 13:03:34,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:34,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:03:34,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:34,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:03:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:03:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:03:34,266 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 18 states. [2018-11-23 13:03:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,073 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 13:03:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:36,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-11-23 13:03:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:03:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-23 13:03:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:03:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-23 13:03:36,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2018-11-23 13:03:36,220 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 13:03:36,221 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:03:36,221 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:03:36,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:03:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:03:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 13:03:36,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:36,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 13:03:36,316 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 13:03:36,317 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 13:03:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,320 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:03:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:03:36,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,320 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 13:03:36,321 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 13:03:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,323 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:03:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:03:36,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:36,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:03:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:03:36,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-11-23 13:03:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:36,326 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:03:36,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:03:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:03:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:03:36,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:36,327 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:36,327 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:36,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1731931358, now seen corresponding path program 2 times [2018-11-23 13:03:36,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:37,007 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-23 13:03:37,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {785#true} call ULTIMATE.init(); {785#true} is VALID [2018-11-23 13:03:37,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {785#true} is VALID [2018-11-23 13:03:37,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {785#true} assume true; {785#true} is VALID [2018-11-23 13:03:37,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {785#true} {785#true} #63#return; {785#true} is VALID [2018-11-23 13:03:37,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {785#true} call #t~ret9 := main(); {785#true} is VALID [2018-11-23 13:03:37,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {785#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:37,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:37,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:37,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:37,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {787#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {788#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:37,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {788#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {788#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:37,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {788#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {789#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-23 13:03:37,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {789#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {789#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-23 13:03:37,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {789#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {790#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:37,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {791#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:37,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {792#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:37,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {792#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 >= 0); {786#false} is VALID [2018-11-23 13:03:37,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {786#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {786#false} is VALID [2018-11-23 13:03:37,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {786#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {786#false} is VALID [2018-11-23 13:03:37,347 INFO L256 TraceCheckUtils]: 19: Hoare triple {786#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {786#false} is VALID [2018-11-23 13:03:37,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {786#false} ~cond := #in~cond; {786#false} is VALID [2018-11-23 13:03:37,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {786#false} assume 0 == ~cond; {786#false} is VALID [2018-11-23 13:03:37,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {786#false} assume !false; {786#false} is VALID [2018-11-23 13:03:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:37,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:37,353 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 13:03:37,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:37,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:37,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:37,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:37,449 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 13:03:37,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-23 13:03:37,822 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:37,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 13:03:37,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:03:37,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:37,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-23 13:03:38,278 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 40 treesize of output 36 [2018-11-23 13:03:38,286 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:38,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 13:03:38,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:38,304 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:38,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:03:38,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:38,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:38,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:38,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-23 13:03:38,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:38,327 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, |main_~#str2~0.offset|, v_prenex_2, |main_~#str1~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|)) (.cse1 (mod (+ v_prenex_2 4294967295) 4294967296))) (and (= (select .cse0 (+ |main_~#str2~0.offset| .cse1)) |main_#t~mem7|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_#t~mem6| (select .cse2 0)) (<= .cse1 2) (= (select .cse0 (+ |main_~#str2~0.offset| 2)) (select .cse2 (+ .cse1 (- 2)))) (<= .cse1 2147483647) (<= 2 .cse1))) [2018-11-23 13:03:38,327 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 13:03:38,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {785#true} call ULTIMATE.init(); {785#true} is VALID [2018-11-23 13:03:38,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {785#true} is VALID [2018-11-23 13:03:38,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {785#true} assume true; {785#true} is VALID [2018-11-23 13:03:38,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {785#true} {785#true} #63#return; {785#true} is VALID [2018-11-23 13:03:38,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {785#true} call #t~ret9 := main(); {785#true} is VALID [2018-11-23 13:03:38,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {785#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:38,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:38,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:38,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:38,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {824#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:38,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {828#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-23 13:03:38,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {828#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {832#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:38,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {836#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:38,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {840#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:38,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {840#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {844#(and (<= 0 main_~i~0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))))} is VALID [2018-11-23 13:03:38,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {844#(and (<= 0 main_~i~0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {848#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:38,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {852#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:38,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {852#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {856#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:03:38,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {856#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {860#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:03:38,410 INFO L256 TraceCheckUtils]: 19: Hoare triple {860#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {864#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:38,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {868#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:03:38,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {868#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {786#false} is VALID [2018-11-23 13:03:38,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {786#false} assume !false; {786#false} is VALID [2018-11-23 13:03:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:38,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2018-11-23 13:03:38,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-11-23 13:03:38,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:38,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:03:38,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:38,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:03:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:03:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:03:38,522 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 21 states. [2018-11-23 13:03:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:40,876 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 13:03:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:40,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-11-23 13:03:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:03:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 13:03:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:03:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 13:03:40,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2018-11-23 13:03:40,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:40,980 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:03:40,981 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:03:40,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:03:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:03:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:03:41,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:41,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:41,037 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:41,038 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:41,040 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:03:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:03:41,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:41,041 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:03:41,041 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:03:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:41,043 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:03:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:03:41,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:41,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:41,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:41,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:03:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:03:41,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-23 13:03:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:41,046 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:03:41,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:03:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:03:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:03:41,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:41,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:41,048 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2031323972, now seen corresponding path program 3 times [2018-11-23 13:03:41,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:41,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:41,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-23 13:03:41,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-23 13:03:41,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-23 13:03:41,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #63#return; {1059#true} is VALID [2018-11-23 13:03:41,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret9 := main(); {1059#true} is VALID [2018-11-23 13:03:41,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:41,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:41,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:41,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-23 13:03:41,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1062#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:41,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1062#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-23 13:03:41,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {1062#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967300 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1063#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-23 13:03:41,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {1063#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1063#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-23 13:03:41,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= (+ main_~i~0 2) 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1064#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:41,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {1064#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1064#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {1064#(and (or (<= (+ main_~i~0 3) 0) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1065#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 4) 0)))} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {1065#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 4) 0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1066#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {1066#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1067#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {1067#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {1060#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1060#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1060#false} is VALID [2018-11-23 13:03:41,424 INFO L256 TraceCheckUtils]: 21: Hoare triple {1060#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1060#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-23 13:03:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:41,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:41,428 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 13:03:41,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:41,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:03:41,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:41,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:41,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-23 13:03:41,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-23 13:03:41,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-23 13:03:41,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #63#return; {1059#true} is VALID [2018-11-23 13:03:41,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret9 := main(); {1059#true} is VALID [2018-11-23 13:03:41,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1086#(and (= main_~max~0 5) (= main_~i~0 0))} is VALID [2018-11-23 13:03:41,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {1086#(and (= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1086#(and (= main_~max~0 5) (= main_~i~0 0))} is VALID [2018-11-23 13:03:41,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {1086#(and (= main_~max~0 5) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#(and (= main_~max~0 5) (= main_~i~0 1))} is VALID [2018-11-23 13:03:41,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {1093#(and (= main_~max~0 5) (= main_~i~0 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1060#false} is VALID [2018-11-23 13:03:41,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {1060#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1060#false} is VALID [2018-11-23 13:03:41,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {1060#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1060#false} is VALID [2018-11-23 13:03:41,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {1060#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1060#false} is VALID [2018-11-23 13:03:41,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {1060#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1060#false} is VALID [2018-11-23 13:03:41,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {1060#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1060#false} is VALID [2018-11-23 13:03:41,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {1060#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1060#false} is VALID [2018-11-23 13:03:41,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {1060#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1060#false} is VALID [2018-11-23 13:03:41,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {1060#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1060#false} is VALID [2018-11-23 13:03:41,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {1060#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1060#false} is VALID [2018-11-23 13:03:41,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {1060#false} assume !(~i~0 >= 0); {1060#false} is VALID [2018-11-23 13:03:41,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1060#false} is VALID [2018-11-23 13:03:41,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1060#false} is VALID [2018-11-23 13:03:41,631 INFO L256 TraceCheckUtils]: 21: Hoare triple {1060#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1060#false} is VALID [2018-11-23 13:03:41,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2018-11-23 13:03:41,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2018-11-23 13:03:41,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-23 13:03:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:41,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:41,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 13:03:41,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-23 13:03:41,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:41,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:03:41,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:41,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:41,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:41,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:41,709 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2018-11-23 13:03:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:43,216 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-23 13:03:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:43,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-23 13:03:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 13:03:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 13:03:43,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-23 13:03:43,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:43,352 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:03:43,352 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:03:43,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:03:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-11-23 13:03:43,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:43,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 34 states. [2018-11-23 13:03:43,569 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 34 states. [2018-11-23 13:03:43,570 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 34 states. [2018-11-23 13:03:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:43,575 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 13:03:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 13:03:43,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:43,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:43,577 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 57 states. [2018-11-23 13:03:43,577 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 57 states. [2018-11-23 13:03:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:43,583 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 13:03:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 13:03:43,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:43,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:43,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:43,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:03:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 13:03:43,586 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2018-11-23 13:03:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:43,586 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 13:03:43,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 13:03:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:03:43,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:43,588 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:43,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:43,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1168836152, now seen corresponding path program 4 times [2018-11-23 13:03:43,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:43,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:43,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:43,989 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 13:03:44,462 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 13:03:44,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {1432#true} call ULTIMATE.init(); {1432#true} is VALID [2018-11-23 13:03:44,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {1432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1432#true} is VALID [2018-11-23 13:03:44,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {1432#true} assume true; {1432#true} is VALID [2018-11-23 13:03:44,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1432#true} {1432#true} #63#return; {1432#true} is VALID [2018-11-23 13:03:44,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {1432#true} call #t~ret9 := main(); {1432#true} is VALID [2018-11-23 13:03:44,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {1432#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1434#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:44,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {1434#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1434#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:44,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {1434#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1435#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:44,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {1435#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1435#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:44,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {1435#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1436#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2018-11-23 13:03:44,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {1436#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1433#false} is VALID [2018-11-23 13:03:44,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {1433#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1433#false} is VALID [2018-11-23 13:03:44,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {1433#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1433#false} is VALID [2018-11-23 13:03:44,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {1433#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1433#false} is VALID [2018-11-23 13:03:44,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {1433#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1433#false} is VALID [2018-11-23 13:03:44,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {1433#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1433#false} is VALID [2018-11-23 13:03:44,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {1433#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1433#false} is VALID [2018-11-23 13:03:44,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {1433#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1433#false} is VALID [2018-11-23 13:03:44,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {1433#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1433#false} is VALID [2018-11-23 13:03:44,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1433#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1433#false} is VALID [2018-11-23 13:03:44,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {1433#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1433#false} is VALID [2018-11-23 13:03:44,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {1433#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1433#false} is VALID [2018-11-23 13:03:44,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {1433#false} assume !(~i~0 >= 0); {1433#false} is VALID [2018-11-23 13:03:44,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {1433#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1433#false} is VALID [2018-11-23 13:03:44,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {1433#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1433#false} is VALID [2018-11-23 13:03:44,521 INFO L256 TraceCheckUtils]: 25: Hoare triple {1433#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1433#false} is VALID [2018-11-23 13:03:44,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {1433#false} ~cond := #in~cond; {1433#false} is VALID [2018-11-23 13:03:44,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {1433#false} assume 0 == ~cond; {1433#false} is VALID [2018-11-23 13:03:44,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {1433#false} assume !false; {1433#false} is VALID [2018-11-23 13:03:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 13:03:44,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:44,522 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 13:03:44,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:03:44,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:03:44,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:44,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:44,795 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 13:03:44,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:44,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:44,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 13:03:45,974 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:45,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:45,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-11-23 13:03:45,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:03:45,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:99, output treesize:45 [2018-11-23 13:03:46,444 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 36 treesize of output 32 [2018-11-23 13:03:46,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:46,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 13:03:46,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,485 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:46,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:03:46,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:46,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2018-11-23 13:03:46,512 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:46,512 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str1~0.base|, v_prenex_3, |main_~#str2~0.base|]. (let ((.cse1 (select |#memory_int| |main_~#str1~0.base|)) (.cse2 (select |#memory_int| |main_~#str2~0.base|)) (.cse0 (mod (+ v_prenex_3 4294967295) 4294967296))) (and (<= .cse0 2147483647) (= (select .cse1 (+ .cse0 (- 4))) (select .cse2 4)) (<= 4 .cse0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_#t~mem6| (select .cse1 0)) (= |main_#t~mem7| (select .cse2 .cse0)) (<= .cse0 4))) [2018-11-23 13:03:46,512 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 13:03:46,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {1432#true} call ULTIMATE.init(); {1432#true} is VALID [2018-11-23 13:03:46,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {1432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1432#true} is VALID [2018-11-23 13:03:46,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {1432#true} assume true; {1432#true} is VALID [2018-11-23 13:03:46,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1432#true} {1432#true} #63#return; {1432#true} is VALID [2018-11-23 13:03:46,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {1432#true} call #t~ret9 := main(); {1432#true} is VALID [2018-11-23 13:03:46,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {1432#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {1455#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1474#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:46,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {1474#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1478#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-23 13:03:46,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {1478#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1482#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:46,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {1482#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1486#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:46,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {1486#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1490#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {1490#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1494#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {1494#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1498#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1502#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 4))} is VALID [2018-11-23 13:03:46,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1502#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1506#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 4))} is VALID [2018-11-23 13:03:46,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {1506#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (= main_~j~0 4))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1510#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str2~0.offset|))} is VALID [2018-11-23 13:03:46,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {1510#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str2~0.offset|))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1514#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:46,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {1514#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {1518#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-23 13:03:46,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {1518#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1522#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} is VALID [2018-11-23 13:03:46,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {1522#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= 0 |main_~#str2~0.offset|) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1526#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:03:46,653 INFO L256 TraceCheckUtils]: 25: Hoare triple {1526#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1530#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:46,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {1530#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1534#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:03:46,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {1534#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1433#false} is VALID [2018-11-23 13:03:46,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {1433#false} assume !false; {1433#false} is VALID [2018-11-23 13:03:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:03:46,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:46,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 19] total 22 [2018-11-23 13:03:46,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-23 13:03:46,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:46,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:03:46,740 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 13:03:46,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:03:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:03:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:03:46,741 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 22 states. [2018-11-23 13:03:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:49,760 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-23 13:03:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:03:49,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-23 13:03:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:03:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2018-11-23 13:03:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:03:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2018-11-23 13:03:49,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 73 transitions. [2018-11-23 13:03:49,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:49,876 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:03:49,876 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:03:49,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:03:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:03:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-11-23 13:03:50,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:50,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 45 states. [2018-11-23 13:03:50,080 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 45 states. [2018-11-23 13:03:50,080 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 45 states. [2018-11-23 13:03:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:50,082 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 13:03:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 13:03:50,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:50,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:50,083 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 52 states. [2018-11-23 13:03:50,083 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 52 states. [2018-11-23 13:03:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:50,086 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 13:03:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 13:03:50,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:50,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:50,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:50,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:03:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-23 13:03:50,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2018-11-23 13:03:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:50,089 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-23 13:03:50,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:03:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 13:03:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:03:50,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:50,090 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:50,090 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:50,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 698706356, now seen corresponding path program 5 times [2018-11-23 13:03:50,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:50,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:50,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:50,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {1833#true} call ULTIMATE.init(); {1833#true} is VALID [2018-11-23 13:03:50,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {1833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1833#true} is VALID [2018-11-23 13:03:50,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {1833#true} assume true; {1833#true} is VALID [2018-11-23 13:03:50,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1833#true} {1833#true} #63#return; {1833#true} is VALID [2018-11-23 13:03:50,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {1833#true} call #t~ret9 := main(); {1833#true} is VALID [2018-11-23 13:03:50,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {1833#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1835#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:50,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {1835#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1835#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:50,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {1835#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:50,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {1836#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1836#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:50,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {1836#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} is VALID [2018-11-23 13:03:50,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {1837#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1837#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} is VALID [2018-11-23 13:03:50,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {1837#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2018-11-23 13:03:50,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {1838#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1834#false} is VALID [2018-11-23 13:03:50,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {1834#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1834#false} is VALID [2018-11-23 13:03:50,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {1834#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {1834#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {1834#false} assume !(~i~0 >= 0); {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {1834#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1834#false} is VALID [2018-11-23 13:03:50,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {1834#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1834#false} is VALID [2018-11-23 13:03:50,380 INFO L256 TraceCheckUtils]: 29: Hoare triple {1834#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1834#false} is VALID [2018-11-23 13:03:50,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {1834#false} ~cond := #in~cond; {1834#false} is VALID [2018-11-23 13:03:50,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {1834#false} assume 0 == ~cond; {1834#false} is VALID [2018-11-23 13:03:50,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {1834#false} assume !false; {1834#false} is VALID [2018-11-23 13:03:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 13:03:50,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:50,382 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 13:03:50,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:03:50,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:03:50,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:50,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:50,516 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 13:03:50,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:50,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:50,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 13:03:51,355 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:51,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:51,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 13:03:51,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:03:51,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:51,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:51,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:51,411 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-23 13:03:51,926 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 40 treesize of output 36 [2018-11-23 13:03:51,934 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:51,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 13:03:51,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:52,006 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:52,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:03:52,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:52,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:52,026 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-23 13:03:52,029 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:52,030 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, |main_~#str2~0.offset|, |main_~#str1~0.base|, v_prenex_4]. (let ((.cse1 (select |#memory_int| |main_~#str1~0.base|)) (.cse2 (select |#memory_int| |main_~#str2~0.base|)) (.cse0 (mod (+ v_prenex_4 4294967295) 4294967296))) (and (<= .cse0 2147483647) (<= .cse0 5) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 5 .cse0) (= |main_#t~mem6| (select .cse1 0)) (= (select .cse2 (+ |main_~#str2~0.offset| 5)) (select .cse1 (+ .cse0 (- 5)))) (= (select .cse2 (+ |main_~#str2~0.offset| .cse0)) |main_#t~mem7|))) [2018-11-23 13:03:52,030 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 13:03:52,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {1833#true} call ULTIMATE.init(); {1833#true} is VALID [2018-11-23 13:03:52,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {1833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1833#true} is VALID [2018-11-23 13:03:52,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {1833#true} assume true; {1833#true} is VALID [2018-11-23 13:03:52,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1833#true} {1833#true} #63#return; {1833#true} is VALID [2018-11-23 13:03:52,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {1833#true} call #t~ret9 := main(); {1833#true} is VALID [2018-11-23 13:03:52,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {1833#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {1857#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:03:52,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {1857#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1857#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:03:52,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {1857#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1864#(and (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {1864#(and (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1864#(and (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {1864#(and (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {1871#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1884#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:52,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {1884#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1888#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-23 13:03:52,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {1888#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1892#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:52,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {1892#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1896#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:03:52,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {1896#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1900#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1904#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {1904#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1908#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {1908#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1912#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} is VALID [2018-11-23 13:03:52,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {1912#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1916#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} is VALID [2018-11-23 13:03:52,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {1916#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1920#(and (= main_~j~0 5) (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {1920#(and (= main_~j~0 5) (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1924#(and (= main_~j~0 5) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 5) (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:03:52,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {1924#(and (= main_~j~0 5) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 5) (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1928#(and (<= 0 main_~i~0) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 5) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5))))} is VALID [2018-11-23 13:03:52,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {1928#(and (<= 0 main_~i~0) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 5) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1932#(and (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 5)))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} is VALID [2018-11-23 13:03:52,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {1932#(and (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 5)))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} assume !(~i~0 >= 0); {1936#(and (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 5) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 5)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:03:52,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {1936#(and (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 5) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 5)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1940#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_4 Int)) (and (<= (mod (+ v_prenex_4 4294967295) 4294967296) 2147483647) (<= (mod (+ v_prenex_4 4294967295) 4294967296) 5) (<= 5 (mod (+ v_prenex_4 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_4 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_4 4294967295) 4294967296) (- 5)))))) (= main_~i~0 0))} is VALID [2018-11-23 13:03:52,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {1940#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_4 Int)) (and (<= (mod (+ v_prenex_4 4294967295) 4294967296) 2147483647) (<= (mod (+ v_prenex_4 4294967295) 4294967296) 5) (<= 5 (mod (+ v_prenex_4 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_4 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 5)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_4 4294967295) 4294967296) (- 5)))))) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1944#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:03:52,130 INFO L256 TraceCheckUtils]: 29: Hoare triple {1944#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1948#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:52,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {1948#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1952#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:03:52,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {1952#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1834#false} is VALID [2018-11-23 13:03:52,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {1834#false} assume !false; {1834#false} is VALID [2018-11-23 13:03:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:52,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23] total 27 [2018-11-23 13:03:52,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-11-23 13:03:52,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:52,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:03:52,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:52,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:03:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:03:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:52,231 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 27 states. [2018-11-23 13:03:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:57,601 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-11-23 13:03:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:03:57,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-11-23 13:03:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:03:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 94 transitions. [2018-11-23 13:03:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:03:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 94 transitions. [2018-11-23 13:03:57,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 94 transitions. [2018-11-23 13:03:57,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:57,771 INFO L225 Difference]: With dead ends: 107 [2018-11-23 13:03:57,772 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 13:03:57,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:03:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 13:03:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2018-11-23 13:03:57,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:57,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 49 states. [2018-11-23 13:03:57,968 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 49 states. [2018-11-23 13:03:57,968 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 49 states. [2018-11-23 13:03:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:57,973 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-23 13:03:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-23 13:03:57,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:57,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:57,974 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 75 states. [2018-11-23 13:03:57,974 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 75 states. [2018-11-23 13:03:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:57,977 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-23 13:03:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-23 13:03:57,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:57,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:57,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:57,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:03:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 13:03:57,980 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2018-11-23 13:03:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:57,980 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 13:03:57,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:03:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 13:03:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:03:57,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:57,982 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:57,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:57,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1977180368, now seen corresponding path program 6 times [2018-11-23 13:03:57,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:57,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:58,476 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-23 13:03:58,921 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-11-23 13:03:59,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {2354#true} call ULTIMATE.init(); {2354#true} is VALID [2018-11-23 13:03:59,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {2354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2354#true} is VALID [2018-11-23 13:03:59,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2018-11-23 13:03:59,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2354#true} #63#return; {2354#true} is VALID [2018-11-23 13:03:59,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {2354#true} call #t~ret9 := main(); {2354#true} is VALID [2018-11-23 13:03:59,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {2354#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {2356#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:59,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {2356#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2356#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:59,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {2356#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2357#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:59,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {2357#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2357#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-23 13:03:59,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {2357#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2358#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} is VALID [2018-11-23 13:03:59,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {2358#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2358#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} is VALID [2018-11-23 13:03:59,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {2358#(and (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 3) main_~max~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2359#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) 0) (<= 3 main_~i~0))} is VALID [2018-11-23 13:03:59,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {2359#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) 0) (<= 3 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2359#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) 0) (<= 3 main_~i~0))} is VALID [2018-11-23 13:03:59,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {2359#(and (<= (+ main_~i~0 2) main_~max~0) (<= (div main_~max~0 4294967296) 0) (<= 3 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2360#(and (<= (div main_~max~0 4294967296) 0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~max~0))} is VALID [2018-11-23 13:03:59,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {2360#(and (<= (div main_~max~0 4294967296) 0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2355#false} is VALID [2018-11-23 13:03:59,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {2355#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2355#false} is VALID [2018-11-23 13:03:59,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {2355#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {2355#false} assume !(~i~0 >= 0); {2355#false} is VALID [2018-11-23 13:03:59,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {2355#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2355#false} is VALID [2018-11-23 13:03:59,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {2355#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2355#false} is VALID [2018-11-23 13:03:59,049 INFO L256 TraceCheckUtils]: 33: Hoare triple {2355#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2355#false} is VALID [2018-11-23 13:03:59,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#false} ~cond := #in~cond; {2355#false} is VALID [2018-11-23 13:03:59,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#false} assume 0 == ~cond; {2355#false} is VALID [2018-11-23 13:03:59,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2018-11-23 13:03:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 13:03:59,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:59,051 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 13:03:59,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:03:59,191 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 13:03:59,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:59,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:59,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {2354#true} call ULTIMATE.init(); {2354#true} is VALID [2018-11-23 13:03:59,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {2354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2354#true} is VALID [2018-11-23 13:03:59,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2018-11-23 13:03:59,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2354#true} #63#return; {2354#true} is VALID [2018-11-23 13:03:59,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {2354#true} call #t~ret9 := main(); {2354#true} is VALID [2018-11-23 13:03:59,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {2354#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {2379#(= main_~max~0 5)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {2379#(= main_~max~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {2379#(= main_~max~0 5)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2379#(= main_~max~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {2379#(= main_~max~0 5)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {2379#(= main_~max~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {2379#(= main_~max~0 5)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {2379#(= main_~max~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {2379#(= main_~max~0 5)} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2379#(= main_~max~0 5)} is VALID [2018-11-23 13:03:59,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {2379#(= main_~max~0 5)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2410#(and (<= main_~i~0 4) (= main_~j~0 0))} is VALID [2018-11-23 13:03:59,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {2410#(and (<= main_~i~0 4) (= main_~j~0 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2414#(and (<= main_~i~0 4) (= main_~j~0 1))} is VALID [2018-11-23 13:03:59,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(and (<= main_~i~0 4) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2418#(and (<= main_~i~0 3) (= main_~j~0 1))} is VALID [2018-11-23 13:03:59,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {2418#(and (<= main_~i~0 3) (= main_~j~0 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2422#(and (<= main_~i~0 3) (= main_~j~0 2))} is VALID [2018-11-23 13:03:59,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#(and (<= main_~i~0 3) (= main_~j~0 2))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2426#(and (= main_~j~0 2) (<= main_~i~0 2))} is VALID [2018-11-23 13:03:59,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {2426#(and (= main_~j~0 2) (<= main_~i~0 2))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2430#(and (= main_~j~0 3) (<= main_~i~0 2))} is VALID [2018-11-23 13:03:59,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {2430#(and (= main_~j~0 3) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2434#(and (= main_~j~0 3) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:59,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {2434#(and (= main_~j~0 3) (<= main_~i~0 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2438#(<= main_~i~0 1)} is VALID [2018-11-23 13:03:59,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {2438#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2442#(<= main_~i~0 0)} is VALID [2018-11-23 13:03:59,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {2442#(<= main_~i~0 0)} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2442#(<= main_~i~0 0)} is VALID [2018-11-23 13:03:59,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {2442#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2449#(<= (+ main_~i~0 1) 0)} is VALID [2018-11-23 13:03:59,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {2449#(<= (+ main_~i~0 1) 0)} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2449#(<= (+ main_~i~0 1) 0)} is VALID [2018-11-23 13:03:59,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {2449#(<= (+ main_~i~0 1) 0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2456#(<= (+ main_~i~0 2) 0)} is VALID [2018-11-23 13:03:59,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {2456#(<= (+ main_~i~0 2) 0)} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2355#false} is VALID [2018-11-23 13:03:59,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {2355#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2355#false} is VALID [2018-11-23 13:03:59,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {2355#false} assume !(~i~0 >= 0); {2355#false} is VALID [2018-11-23 13:03:59,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {2355#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2355#false} is VALID [2018-11-23 13:03:59,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {2355#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2355#false} is VALID [2018-11-23 13:03:59,634 INFO L256 TraceCheckUtils]: 33: Hoare triple {2355#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2355#false} is VALID [2018-11-23 13:03:59,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#false} ~cond := #in~cond; {2355#false} is VALID [2018-11-23 13:03:59,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#false} assume 0 == ~cond; {2355#false} is VALID [2018-11-23 13:03:59,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2018-11-23 13:03:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:59,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:59,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 19 [2018-11-23 13:03:59,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-11-23 13:03:59,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:59,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:03:59,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:59,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:03:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:03:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:03:59,704 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 19 states. [2018-11-23 13:04:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:01,823 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-11-23 13:04:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:04:01,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-11-23 13:04:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2018-11-23 13:04:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2018-11-23 13:04:01,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 84 transitions. [2018-11-23 13:04:01,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:01,934 INFO L225 Difference]: With dead ends: 99 [2018-11-23 13:04:01,934 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:04:01,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:04:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:04:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-11-23 13:04:02,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:02,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 46 states. [2018-11-23 13:04:02,149 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 46 states. [2018-11-23 13:04:02,149 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 46 states. [2018-11-23 13:04:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:02,153 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-23 13:04:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-23 13:04:02,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:02,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:02,154 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 65 states. [2018-11-23 13:04:02,154 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 65 states. [2018-11-23 13:04:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:02,157 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-23 13:04:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-23 13:04:02,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:02,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:02,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:02,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:04:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 13:04:02,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-11-23 13:04:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:02,160 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 13:04:02,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:04:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 13:04:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:04:02,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:02,161 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:02,162 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:02,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 885326793, now seen corresponding path program 1 times [2018-11-23 13:04:02,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:02,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:02,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:02,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:02,714 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:04:03,911 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-23 13:04:04,252 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-11-23 13:04:04,463 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-11-23 13:04:04,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {2854#true} call ULTIMATE.init(); {2854#true} is VALID [2018-11-23 13:04:04,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {2854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2854#true} is VALID [2018-11-23 13:04:04,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {2854#true} assume true; {2854#true} is VALID [2018-11-23 13:04:04,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2854#true} {2854#true} #63#return; {2854#true} is VALID [2018-11-23 13:04:04,967 INFO L256 TraceCheckUtils]: 4: Hoare triple {2854#true} call #t~ret9 := main(); {2854#true} is VALID [2018-11-23 13:04:04,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {2854#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {2856#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:04,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {2856#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2856#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:04,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {2856#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2857#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {2857#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2857#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {2857#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2858#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {2858#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2858#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {2858#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2859#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~i~0))} is VALID [2018-11-23 13:04:04,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {2859#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2859#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~i~0))} is VALID [2018-11-23 13:04:04,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {2859#(and (= |main_~#str1~0.offset| 0) (<= main_~i~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {2860#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2861#(and (= |main_~#str1~0.offset| 0) (or (and (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {2861#(and (= |main_~#str1~0.offset| 0) (or (and (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2862#(and (= |main_~#str1~0.offset| 0) (<= main_~j~0 1) (<= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (and (= main_~max~0 (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967296)))))} is VALID [2018-11-23 13:04:04,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {2862#(and (= |main_~#str1~0.offset| 0) (<= main_~j~0 1) (<= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (and (= main_~max~0 (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967296)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2863#(and (= |main_~#str1~0.offset| 0) (<= main_~j~0 1) (<= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295)))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {2863#(and (= |main_~#str1~0.offset| 0) (<= main_~j~0 1) (<= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295)))) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2864#(and (<= 2 main_~j~0) (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967296))) (and (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) main_~max~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:04,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {2864#(and (<= 2 main_~j~0) (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967296))) (and (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) main_~max~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~j~0 2))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2865#(and (<= 2 main_~j~0) (= |main_~#str1~0.offset| 0) (or (and (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~max~0 4294967295) (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:04,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {2865#(and (<= 2 main_~j~0) (= |main_~#str1~0.offset| 0) (or (and (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (= (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~max~0 4294967295) (+ main_~i~0 main_~j~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~j~0 2))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2866#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ |main_~#str1~0.offset| main_~max~0 4294967296))) (and (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ |main_~#str1~0.offset| main_~max~0)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (<= main_~j~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~j~0))} is VALID [2018-11-23 13:04:04,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {2866#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ |main_~#str1~0.offset| main_~max~0 4294967296))) (and (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ |main_~#str1~0.offset| main_~max~0)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (<= main_~j~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 3 main_~j~0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2867#(and (= |main_~#str1~0.offset| 0) (or (not (= 1 (+ |main_~#str1~0.offset| main_~i~0))) (and (<= main_~j~0 3) (<= 3 main_~j~0) (= (+ |main_~#str1~0.offset| main_~max~0 4294967295) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {2867#(and (= |main_~#str1~0.offset| 0) (or (not (= 1 (+ |main_~#str1~0.offset| main_~i~0))) (and (<= main_~j~0 3) (<= 3 main_~j~0) (= (+ |main_~#str1~0.offset| main_~max~0 4294967295) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2868#(and (or (not (= 1 (+ |main_~#str1~0.offset| main_~i~0))) (and (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967295)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 1))) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (or (not (= (+ |main_~#str1~0.offset| main_~max~0 4294967295) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (or (not (= (+ |main_~#str1~0.offset| main_~max~0) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1))) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:04,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {2868#(and (or (not (= 1 (+ |main_~#str1~0.offset| main_~i~0))) (and (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967295)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 1))) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))) (or (not (= (+ |main_~#str1~0.offset| main_~max~0 4294967295) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (or (not (= (+ |main_~#str1~0.offset| main_~max~0) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1))) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2869#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (and (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) 1) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ |main_~#str1~0.offset| main_~i~0 1) 0) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) 1) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))) (<= 1 (+ |main_~#str1~0.offset| main_~i~0))))} is VALID [2018-11-23 13:04:05,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {2869#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (and (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) 1) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ |main_~#str1~0.offset| main_~i~0 1) 0) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) 1) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| (* (- 1) main_~i~0) main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))) (<= 1 (+ |main_~#str1~0.offset| main_~i~0))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2870#(and (= |main_~#str1~0.offset| 0) (or (and (<= 0 main_~i~0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))))) (<= 1 (+ |main_~#str1~0.offset| main_~i~0))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:05,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {2870#(and (= |main_~#str1~0.offset| 0) (or (and (<= 0 main_~i~0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))))) (<= 1 (+ |main_~#str1~0.offset| main_~i~0))) (= |main_~#str2~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2871#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (and (<= 0 (+ main_~i~0 1)) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))))) (<= 0 (+ |main_~#str1~0.offset| main_~i~0))))} is VALID [2018-11-23 13:04:05,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {2871#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (and (<= 0 (+ main_~i~0 1)) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294)))))) (<= 0 (+ |main_~#str1~0.offset| main_~i~0))))} assume !(~i~0 >= 0); {2872#(and (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294))))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:05,007 INFO L273 TraceCheckUtils]: 29: Hoare triple {2872#(and (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) (- 2)))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| main_~max~0 (* (- 4294967296) (div (+ main_~max~0 4294967295) 4294967296)) 4294967294))))) (= |main_~#str2~0.offset| 0))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:05,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:05,008 INFO L256 TraceCheckUtils]: 31: Hoare triple {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2854#true} is VALID [2018-11-23 13:04:05,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {2854#true} ~cond := #in~cond; {2874#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:04:05,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {2874#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:04:05,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:04:05,011 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #67#return; {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:05,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {2873#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem7;#t~post8 := ~j~0;~j~0 := #t~post8 - 1;havoc #t~post8; {2876#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:05,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {2876#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2877#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= (+ |main_~#str1~0.offset| main_~i~0) 1) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:04:05,015 INFO L273 TraceCheckUtils]: 38: Hoare triple {2877#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= (+ |main_~#str1~0.offset| main_~i~0) 1) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2878#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:04:05,016 INFO L256 TraceCheckUtils]: 39: Hoare triple {2878#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:04:05,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {2875#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2879#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:04:05,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {2879#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2855#false} is VALID [2018-11-23 13:04:05,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {2855#false} assume !false; {2855#false} is VALID [2018-11-23 13:04:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:04:05,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:05,029 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 13:04:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:05,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:05,134 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 13:04:05,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 13:04:05,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 13:04:05,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:04:05,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 13:04:05,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:04:05,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:05,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:04:05,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:93, output treesize:85 [2018-11-23 13:04:06,114 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:04:06,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:06,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 13:04:06,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:06,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 40 [2018-11-23 13:04:06,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:06,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:06,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:06,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:125, output treesize:58 [2018-11-23 13:04:08,676 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|)) (.cse1 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (.cse0 (mod (+ v_prenex_6 4294967295) 4294967296))) (and (<= 4 .cse0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= .cse0 4) (<= .cse0 2147483647) (= (select .cse1 (+ .cse0 (- 3))) (select .cse2 (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select .cse2 (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select .cse1 (+ .cse0 (- 4))))))) is different from true [2018-11-23 13:04:13,080 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 13:04:17,166 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 13:04:17,710 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 60 treesize of output 52 [2018-11-23 13:04:17,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:17,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:17,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:04:17,884 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 13:04:17,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 13:04:17,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,127 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:04:18,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:04:18,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:85, output treesize:3 [2018-11-23 13:04:18,157 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:18,158 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, |main_~#str2~0.offset|, v_prenex_6, |main_~#str1~0.base|]. (let ((.cse0 (mod (+ v_prenex_6 4294967295) 4294967296)) (.cse1 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|))) (and (<= 4 .cse0) (<= .cse0 4) (= (select .cse1 (+ |main_~#str2~0.offset| .cse0 (- 1))) |main_#t~mem7|) (<= .cse0 2147483647) (= (select .cse1 (+ |main_~#str2~0.offset| 4)) (select .cse2 (+ .cse0 (- 4)))) (= (select .cse2 (+ .cse0 (- 3))) (select .cse1 (+ |main_~#str2~0.offset| 3))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse2 1) |main_#t~mem6|))) [2018-11-23 13:04:18,158 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 13:04:20,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {2854#true} call ULTIMATE.init(); {2854#true} is VALID [2018-11-23 13:04:20,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {2854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2854#true} is VALID [2018-11-23 13:04:20,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {2854#true} assume true; {2854#true} is VALID [2018-11-23 13:04:20,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2854#true} {2854#true} #63#return; {2854#true} is VALID [2018-11-23 13:04:20,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {2854#true} call #t~ret9 := main(); {2854#true} is VALID [2018-11-23 13:04:20,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {2854#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {2898#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {2898#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2898#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {2898#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {2905#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {2936#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-23 13:04:20,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {2936#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2940#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-23 13:04:20,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {2940#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2944#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:04:20,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {2944#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2948#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-23 13:04:20,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {2948#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2952#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {2952#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2956#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {2956#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2960#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {2960#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2964#(or (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3))) (= main_~j~0 4) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3))) (= main_~j~0 4)))} is VALID [2018-11-23 13:04:20,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {2964#(or (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3))) (= main_~j~0 4) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3))) (= main_~j~0 4)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2968#(or (and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= main_~j~0 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1))) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= main_~j~0 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1)))))} is VALID [2018-11-23 13:04:20,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {2968#(or (and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= main_~j~0 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1))) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= main_~j~0 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {2972#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1))))} is VALID [2018-11-23 13:04:20,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {2972#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0 1))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {2976#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 3)))))} is VALID [2018-11-23 13:04:20,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {2976#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 3)))))} assume !(~i~0 >= 0); {2980#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 3)))))} is VALID [2018-11-23 13:04:20,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {2980#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 3)))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,306 INFO L256 TraceCheckUtils]: 31: Hoare triple {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2991#(exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))))))} is VALID [2018-11-23 13:04:20,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {2991#(exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))))))} ~cond := #in~cond; {2995#(and (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 13:04:20,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {2995#(and (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {2999#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))))} is VALID [2018-11-23 13:04:20,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {2999#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))))} assume true; {2999#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))))} is VALID [2018-11-23 13:04:20,310 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2999#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_6 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 3))) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ (mod (+ v_prenex_6 4294967295) 4294967296) (- 4)))))))} {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #67#return; {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {2984#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (= main_~j~0 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem7;#t~post8 := ~j~0;~j~0 := #t~post8 - 1;havoc #t~post8; {3009#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= (mod (+ v_prenex_6 4294967295) 4294967296) (+ main_~j~0 1)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:20,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {3009#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= (mod (+ v_prenex_6 4294967295) 4294967296) (+ main_~j~0 1)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3013#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= (mod (+ v_prenex_6 4294967295) 4294967296) (+ main_~j~0 1)))) (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:04:20,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {3013#(and (exists ((v_prenex_6 Int)) (and (<= 4 (mod (+ v_prenex_6 4294967295) 4294967296)) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 4) (<= (mod (+ v_prenex_6 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 3)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 3)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_6 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= (mod (+ v_prenex_6 4294967295) 4294967296) (+ main_~j~0 1)))) (= 0 |main_~#str1~0.offset|) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2878#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:04:20,317 INFO L256 TraceCheckUtils]: 39: Hoare triple {2878#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3020#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:20,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {3020#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3024#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:20,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {3024#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2855#false} is VALID [2018-11-23 13:04:20,319 INFO L273 TraceCheckUtils]: 42: Hoare triple {2855#false} assume !false; {2855#false} is VALID [2018-11-23 13:04:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2018-11-23 13:04:20,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-11-23 13:04:20,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 43 [2018-11-23 13:04:20,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:20,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 13:04:20,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:20,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 13:04:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 13:04:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1991, Unknown=4, NotChecked=90, Total=2256 [2018-11-23 13:04:20,484 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 48 states. [2018-11-23 13:04:51,288 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-11-23 13:04:55,822 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-23 13:05:06,841 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2018-11-23 13:05:12,028 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2018-11-23 13:05:14,462 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-11-23 13:05:17,063 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-11-23 13:05:19,717 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-11-23 13:05:22,150 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 53 [2018-11-23 13:05:26,963 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2018-11-23 13:05:29,804 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2018-11-23 13:05:30,246 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 38 [2018-11-23 13:05:32,654 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 41 [2018-11-23 13:05:38,845 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-11-23 13:05:42,973 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-23 13:06:35,707 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 56 [2018-11-23 13:06:36,606 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 59 [2018-11-23 13:06:37,133 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 41 [2018-11-23 13:06:37,461 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-11-23 13:06:38,234 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-11-23 13:06:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:38,595 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 13:06:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:06:38,595 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 43 [2018-11-23 13:06:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:06:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 72 transitions. [2018-11-23 13:06:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:06:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 72 transitions. [2018-11-23 13:06:38,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 72 transitions. [2018-11-23 13:06:39,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:39,095 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:06:39,095 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:06:39,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=687, Invalid=5790, Unknown=7, NotChecked=158, Total=6642 [2018-11-23 13:06:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:06:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-11-23 13:06:39,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:39,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 54 states. [2018-11-23 13:06:39,813 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 54 states. [2018-11-23 13:06:39,813 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 54 states. [2018-11-23 13:06:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,816 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:06:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 13:06:39,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,816 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 69 states. [2018-11-23 13:06:39,816 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 69 states. [2018-11-23 13:06:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,818 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:06:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 13:06:39,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:39,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:06:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 13:06:39,821 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 43 [2018-11-23 13:06:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:39,821 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 13:06:39,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 13:06:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 13:06:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:06:39,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:39,823 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:39,823 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:39,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash -480781312, now seen corresponding path program 2 times [2018-11-23 13:06:39,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:40,387 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:06:41,677 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 13:06:41,878 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-11-23 13:06:42,079 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2018-11-23 13:06:42,274 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-23 13:06:43,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {3418#true} call ULTIMATE.init(); {3418#true} is VALID [2018-11-23 13:06:43,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {3418#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3418#true} is VALID [2018-11-23 13:06:43,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {3418#true} assume true; {3418#true} is VALID [2018-11-23 13:06:43,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3418#true} {3418#true} #63#return; {3418#true} is VALID [2018-11-23 13:06:43,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {3418#true} call #t~ret9 := main(); {3418#true} is VALID [2018-11-23 13:06:43,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {3418#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;havoc ~j~0;~i~0 := 0; {3420#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {3420#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {3420#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {3420#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3421#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {3421#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {3421#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {3421#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3422#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {3422#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {3422#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {3422#(and (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet1; {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {3423#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {3424#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {3424#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3425#(and (= |main_~#str1~0.offset| 0) (= 1 main_~j~0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {3425#(and (= |main_~#str1~0.offset| 0) (= 1 main_~j~0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967295))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1) main_~max~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (<= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= |main_~#str2~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {3426#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))))} is VALID [2018-11-23 13:06:43,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {3426#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= 1 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3427#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2)) (= |main_~#str2~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))))} is VALID [2018-11-23 13:06:43,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {3427#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967294)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2)) (= |main_~#str2~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (and (<= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 2)) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {3428#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 3 main_~i~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 3) main_~max~0)))} is VALID [2018-11-23 13:06:43,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {3428#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 3 main_~i~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 3) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3429#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ |main_~#str1~0.offset| 3) (+ main_~j~0 |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2)))) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= 3 main_~i~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 3) main_~max~0)))} is VALID [2018-11-23 13:06:43,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {3429#(and (= |main_~#str1~0.offset| 0) (or (and (<= (+ |main_~#str1~0.offset| 3) (+ main_~j~0 |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2)))) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= 3 main_~i~0) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 3) main_~max~0)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {3430#(and (or (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967292)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 4) main_~max~0)) (or (<= 2 main_~i~0) (and (<= (+ |main_~#str1~0.offset| 3) (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967292) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {3430#(and (or (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967292)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 4) main_~max~0)) (or (<= 2 main_~i~0) (and (<= (+ |main_~#str1~0.offset| 3) (+ main_~j~0 |main_~#str2~0.offset|)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967292) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3431#(and (or (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967292)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 4) main_~max~0)) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (<= 2 main_~i~0) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (and (not (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967292) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))} is VALID [2018-11-23 13:06:43,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {3431#(and (or (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967292)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 4) main_~max~0)) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (<= 2 main_~i~0) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (and (not (= (+ main_~j~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967292) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {3432#(and (or (<= 1 main_~i~0) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (and (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967291) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 5) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967291)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {3432#(and (or (<= 1 main_~i~0) (<= (+ main_~max~0 4294967292) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (< (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 2147483648)) (and (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (+ |main_~#str1~0.offset| 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~max~0 4294967291) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))) (or (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 5) main_~max~0) (and (<= (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (+ main_~max~0 4294967291)) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {3433#(and (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (= |main_~#str2~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967291) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 1 main_~i~0)))} is VALID [2018-11-23 13:06:43,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {3433#(and (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (= |main_~#str2~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= (+ main_~max~0 4294967291) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 1 main_~i~0)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {3434#(and (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (or (and (<= (+ main_~max~0 4294967290) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2)))) (<= 0 main_~i~0)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {3434#(and (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (or (and (<= (+ main_~max~0 4294967290) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2)))) (<= 0 main_~i~0)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 >= 0); {3435#(and (= |main_~#str1~0.offset| 0) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (= |main_~#str2~0.offset| 0) (<= (+ main_~max~0 4294967291) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} is VALID [2018-11-23 13:06:43,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {3435#(and (= |main_~#str1~0.offset| 0) (<= (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) (+ main_~max~0 4294967291)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (= |main_~#str2~0.offset| 0) (<= (+ main_~max~0 4294967291) (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,497 INFO L256 TraceCheckUtils]: 31: Hoare triple {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3418#true} is VALID [2018-11-23 13:06:43,498 INFO L273 TraceCheckUtils]: 32: Hoare triple {3418#true} ~cond := #in~cond; {3437#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:06:43,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {3437#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:06:43,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:06:43,500 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} #67#return; {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {3436#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| 2))) (<= main_~j~0 4) (= |main_~#str2~0.offset| 0) (< 3 main_~j~0) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem7;#t~post8 := ~j~0;~j~0 := #t~post8 - 1;havoc #t~post8; {3439#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= main_~i~0 0))} is VALID [2018-11-23 13:06:43,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {3439#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 2)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,504 INFO L256 TraceCheckUtils]: 39: Hoare triple {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3418#true} is VALID [2018-11-23 13:06:43,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {3418#true} ~cond := #in~cond; {3418#true} is VALID [2018-11-23 13:06:43,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {3418#true} assume !(0 == ~cond); {3418#true} is VALID [2018-11-23 13:06:43,504 INFO L273 TraceCheckUtils]: 42: Hoare triple {3418#true} assume true; {3418#true} is VALID [2018-11-23 13:06:43,505 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3418#true} {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} #67#return; {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {3440#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~j~0 (- 1))))) (= |main_~#str2~0.offset| 0))} havoc #t~mem6;havoc #t~mem7;#t~post8 := ~j~0;~j~0 := #t~post8 - 1;havoc #t~post8; {3441#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {3441#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (+ main_~i~0 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3442#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:06:43,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {3442#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3443#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 13:06:43,508 INFO L256 TraceCheckUtils]: 47: Hoare triple {3443#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:06:43,509 INFO L273 TraceCheckUtils]: 48: Hoare triple {3438#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3444#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:06:43,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {3444#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3419#false} is VALID [2018-11-23 13:06:43,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {3419#false} assume !false; {3419#false} is VALID [2018-11-23 13:06:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:06:43,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:43,524 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 13:06:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:43,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:43,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:43,634 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 13:06:43,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:43,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:43,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 13:06:43,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-11-23 13:06:43,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:06:43,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:43,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,002 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:06:44,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2018-11-23 13:06:44,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 15 [2018-11-23 13:06:44,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,047 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:06:44,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:06:44,099 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:293, output treesize:139 [2018-11-23 13:06:44,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-11-23 13:06:44,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:44,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 40 [2018-11-23 13:06:44,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2018-11-23 13:06:44,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:44,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 40 [2018-11-23 13:06:44,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 13:06:44,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:189, output treesize:181 [2018-11-23 13:06:44,951 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:06:44,952 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, v_main_~j~0_38, v_prenex_9, v_prenex_8]. (let ((.cse0 (= |main_~#str1~0.offset| 0)) (.cse8 (+ |main_~#str1~0.offset| main_~i~0)) (.cse12 (+ main_~max~0 2147483648)) (.cse2 (+ |main_~#str1~0.offset| 2)) (.cse4 (+ |main_~#str1~0.offset| main_~i~0 1)) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (= |main_~#str2~0.offset| 0)) (.cse10 (+ |main_~#str1~0.offset| 3)) (.cse11 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (or (let ((.cse1 (select |v_#memory_int_17| |main_~#str2~0.base|)) (.cse3 (select |v_#memory_int_17| |main_~#str1~0.base|)) (.cse9 (+ main_~i~0 .cse11 4)) (.cse7 (+ v_main_~j~0_38 |main_~#str2~0.offset|))) (and .cse0 (= (select .cse1 .cse2) (select .cse3 .cse4)) (<= (+ v_main_~j~0_38 1) main_~j~0) .cse5 .cse6 (= (store |v_#memory_int_17| |main_~#str2~0.base| (store .cse1 .cse7 (select .cse3 .cse8))) |#memory_int|) (<= .cse9 main_~max~0) (<= main_~max~0 .cse9) (<= .cse10 .cse7) (< .cse11 .cse12))) (let ((.cse13 (select v_prenex_9 |main_~#str2~0.base|)) (.cse15 (select v_prenex_9 |main_~#str1~0.base|)) (.cse17 (+ main_~max~0 4294967292)) (.cse16 (+ main_~i~0 .cse11)) (.cse14 (+ v_prenex_8 |main_~#str2~0.offset|))) (and .cse0 (= (store v_prenex_9 |main_~#str2~0.base| (store .cse13 .cse14 (select .cse15 .cse8))) |#memory_int|) (<= .cse16 .cse17) (<= .cse12 .cse11) (= (select .cse13 .cse2) (select .cse15 .cse4)) (<= .cse17 .cse16) .cse5 .cse6 (<= (+ v_prenex_8 1) main_~j~0) (<= .cse10 .cse14))))) [2018-11-23 13:06:44,952 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~j~0_38, v_prenex_8]. (let ((.cse2 (select |#memory_int| |main_~#str2~0.base|)) (.cse14 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse0 (= |main_~#str1~0.offset| 0)) (.cse10 (+ main_~max~0 2147483648)) (.cse4 (= (select .cse2 (+ |main_~#str1~0.offset| 2)) (select .cse14 (+ |main_~#str1~0.offset| main_~i~0 1)))) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (= |main_~#str2~0.offset| 0)) (.cse8 (+ |main_~#str1~0.offset| 3)) (.cse1 (select .cse14 (+ |main_~#str1~0.offset| main_~i~0))) (.cse9 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (or (let ((.cse7 (+ main_~i~0 .cse9 4)) (.cse3 (+ v_main_~j~0_38 |main_~#str2~0.offset|))) (and .cse0 (= .cse1 (select .cse2 .cse3)) .cse4 (<= (+ v_main_~j~0_38 1) main_~j~0) .cse5 .cse6 (<= .cse7 main_~max~0) (<= main_~max~0 .cse7) (<= .cse8 .cse3) (< .cse9 .cse10))) (let ((.cse12 (+ main_~max~0 4294967292)) (.cse11 (+ main_~i~0 .cse9)) (.cse13 (+ v_prenex_8 |main_~#str2~0.offset|))) (and .cse0 (<= .cse11 .cse12) (<= .cse10 .cse9) .cse4 (<= .cse12 .cse11) .cse5 .cse6 (<= .cse8 .cse13) (<= (+ v_prenex_8 1) main_~j~0) (= .cse1 (select .cse2 .cse13))))))) [2018-11-23 13:06:45,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 107 [2018-11-23 13:06:45,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:45,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:45,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:45,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 72 [2018-11-23 13:06:45,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:46,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:06:46,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:227, output treesize:110 [2018-11-23 13:06:46,137 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:06:46,137 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_11, v_prenex_10, v_main_~j~0_38, |v_#memory_int_18|, v_main_~j~0_39, v_prenex_8]. (let ((.cse1 (+ |main_~#str1~0.offset| main_~i~0 1)) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (<= 0 main_~i~0)) (.cse11 (+ main_~max~0 2147483648)) (.cse14 (+ |main_~#str1~0.offset| main_~i~0)) (.cse7 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse8 (= |main_~#str2~0.offset| 0)) (.cse9 (+ |main_~#str1~0.offset| 3)) (.cse12 (+ |main_~#str1~0.offset| 2)) (.cse13 (+ |main_~#str1~0.offset| main_~i~0 2)) (.cse10 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (or (let ((.cse4 (+ main_~i~0 .cse10 5)) (.cse3 (+ v_main_~j~0_38 |main_~#str2~0.offset|)) (.cse2 (select v_prenex_11 |main_~#str2~0.base|)) (.cse0 (select v_prenex_11 |main_~#str1~0.base|))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) (<= main_~max~0 .cse4) (<= .cse4 main_~max~0) .cse5 .cse6 .cse7 .cse8 (<= (+ v_main_~j~0_38 1) v_prenex_10) (<= .cse9 .cse3) (< .cse10 .cse11) (= (select .cse2 .cse12) (select .cse0 .cse13)) (= (store v_prenex_11 |main_~#str2~0.base| (store .cse2 (+ v_prenex_10 |main_~#str2~0.offset|) (select .cse0 .cse14))) |#memory_int|))) (let ((.cse18 (+ main_~max~0 4294967291)) (.cse17 (+ main_~i~0 .cse10)) (.cse15 (select |v_#memory_int_18| |main_~#str2~0.base|)) (.cse16 (select |v_#memory_int_18| |main_~#str1~0.base|))) (and (= (select .cse15 (+ v_prenex_8 |main_~#str2~0.offset|)) (select .cse16 .cse1)) (<= .cse17 .cse18) .cse5 .cse6 (<= .cse11 .cse10) (= (store |v_#memory_int_18| |main_~#str2~0.base| (store .cse15 (+ v_main_~j~0_39 |main_~#str2~0.offset|) (select .cse16 .cse14))) |#memory_int|) .cse7 .cse8 (<= (+ v_prenex_8 1) v_main_~j~0_39) (<= .cse18 .cse17) (<= .cse9 (+ |main_~#str2~0.offset| v_prenex_8)) (= (select .cse15 .cse12) (select .cse16 .cse13)))))) [2018-11-23 13:06:46,137 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~j~0_39, v_prenex_8]. (let ((.cse2 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (let ((.cse1 (+ main_~max~0 4294967291)) (.cse0 (+ main_~i~0 .cse2)) (.cse3 (select |#memory_int| |main_~#str2~0.base|)) (.cse4 (select |#memory_int| |main_~#str1~0.base|))) (and (<= .cse0 .cse1) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~max~0 2147483648) .cse2) (= (select .cse3 (+ v_main_~j~0_39 |main_~#str2~0.offset|)) (select .cse4 (+ |main_~#str1~0.offset| main_~i~0))) (= (select .cse4 (+ |main_~#str1~0.offset| main_~i~0 2)) (select .cse3 (+ |main_~#str1~0.offset| 2))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= (+ v_prenex_8 1) v_main_~j~0_39) (<= .cse1 .cse0) (<= (+ |main_~#str1~0.offset| 3) (+ |main_~#str2~0.offset| v_prenex_8)) (= (select .cse3 (+ v_prenex_8 |main_~#str2~0.offset|)) (select .cse4 (+ |main_~#str1~0.offset| main_~i~0 1)))))) [2018-11-23 13:06:51,127 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_15 Int) (|v_main_~#str2~0.base_BEFORE_CALL_2| Int) (v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#str1~0.base_BEFORE_CALL_2| Int)) (let ((.cse4 (+ v_prenex_13 4294967295))) (let ((.cse0 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (.cse1 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_2|)) (.cse3 (+ v_prenex_13 4294967291)) (.cse2 (+ (* 4294967296 (div .cse4 4294967296)) v_prenex_14))) (and (= (select .cse0 (+ v_prenex_14 1)) (select .cse1 v_prenex_15)) (= (select .cse0 (+ v_prenex_14 2)) (select .cse1 2)) (<= v_prenex_14 0) (<= .cse2 .cse3) (<= (mod .cse4 4294967296) 2147483647) (not (= |v_main_~#str2~0.base_BEFORE_CALL_2| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (= (select .cse0 v_prenex_14) (select .cse1 v_prenex_12)) (<= 0 v_prenex_14) (<= (+ v_prenex_15 1) v_prenex_12) (<= 3 v_prenex_15) (<= .cse3 .cse2))))) is different from true [2018-11-23 13:06:54,448 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 13:06:58,666 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 50