/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:47,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:47,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:47,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:47,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:47,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:47,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:47,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:47,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:47,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:47,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:47,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:47,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:47,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:47,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:47,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:47,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:47,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:47,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:47,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:47,245 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:47,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:47,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:47,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:47,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:47,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:47,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:47,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:47,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:47,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:47,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:47,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:47,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:47,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:47,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:47,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:47,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:47,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:47,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:47,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:47,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:47,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:47,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:47,269 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:47,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:47,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:47,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:47,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:47,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:47,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:47,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:47,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:47,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:47,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:47,272 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:41:47,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:47,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:47,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:47,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:47,512 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:47,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2022-04-15 05:41:47,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b6621f4/1287a465a8f84ac4ae76593c168ad5f1/FLAGda9b376ab [2022-04-15 05:41:47,860 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:47,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2022-04-15 05:41:47,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b6621f4/1287a465a8f84ac4ae76593c168ad5f1/FLAGda9b376ab [2022-04-15 05:41:48,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b6621f4/1287a465a8f84ac4ae76593c168ad5f1 [2022-04-15 05:41:48,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:48,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:48,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:48,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:48,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:48,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7fbea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48, skipping insertion in model container [2022-04-15 05:41:48,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:48,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:48,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-04-15 05:41:48,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:48,443 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:48,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-04-15 05:41:48,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:48,467 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:48,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48 WrapperNode [2022-04-15 05:41:48,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:48,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:48,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:48,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:48,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:48,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:48,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:48,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:48,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (1/1) ... [2022-04-15 05:41:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:48,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:41:48,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:41:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 05:41:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:48,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:48,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:48,800 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:48,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:48,804 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 05:41:48,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:48 BoogieIcfgContainer [2022-04-15 05:41:48,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:48,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:48,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:48,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:48,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:48" (1/3) ... [2022-04-15 05:41:48,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6972480d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:48, skipping insertion in model container [2022-04-15 05:41:48,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:48" (2/3) ... [2022-04-15 05:41:48,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6972480d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:48, skipping insertion in model container [2022-04-15 05:41:48,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:48" (3/3) ... [2022-04-15 05:41:48,812 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2022-04-15 05:41:48,815 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:48,815 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:48,878 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:48,884 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:41:48,884 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:48,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:48,900 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:48,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2022-04-15 05:41:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406160935] [2022-04-15 05:41:48,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 2 times [2022-04-15 05:41:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:48,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844796335] [2022-04-15 05:41:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 05:41:49,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 05:41:49,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 05:41:49,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:49,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-04-15 05:41:49,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 05:41:49,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 05:41:49,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret13 := main(); {30#true} is VALID [2022-04-15 05:41:49,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:41:49,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:41:49,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= 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); {36#(and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:41:49,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {31#false} is VALID [2022-04-15 05:41:49,240 INFO L290 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 [2022-04-15 05:41:49,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {31#false} is VALID [2022-04-15 05:41:49,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {31#false} is VALID [2022-04-15 05:41:49,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-15 05:41:49,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-15 05:41:49,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-15 05:41:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:49,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844796335] [2022-04-15 05:41:49,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844796335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:49,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:49,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406160935] [2022-04-15 05:41:49,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406160935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:49,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421030242] [2022-04-15 05:41:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:49,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:49,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:49,298 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,604 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 05:41:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 05:41:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 05:41:49,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-15 05:41:49,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,687 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:41:49,687 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:41:49,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 05:41:49,692 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:49,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:41:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 05:41:49,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:49,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,738 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,738 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,741 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 05:41:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 05:41:49,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-15 05:41:49,743 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-15 05:41:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,745 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 05:41:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 05:41:49,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:49,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 05:41:49,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-04-15 05:41:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:49,752 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 05:41:49,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 05:41:49,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 05:41:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:41:49,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:49,783 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:49,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:49,783 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2022-04-15 05:41:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925403369] [2022-04-15 05:41:49,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:49,802 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:49,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 2 times [2022-04-15 05:41:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:49,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853994790] [2022-04-15 05:41:49,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:49,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:41:49,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:41:49,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #67#return; {234#true} is VALID [2022-04-15 05:41:49,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:49,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:41:49,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:41:49,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #67#return; {234#true} is VALID [2022-04-15 05:41:49,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret13 := main(); {234#true} is VALID [2022-04-15 05:41:49,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {239#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 05:41:49,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {235#false} is VALID [2022-04-15 05:41:49,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#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); {235#false} is VALID [2022-04-15 05:41:49,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume !(~i~0 >= 0); {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#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; {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {235#false} is VALID [2022-04-15 05:41:49,932 INFO L272 TraceCheckUtils]: 13: Hoare triple {235#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 05:41:49,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 05:41:49,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 05:41:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:49,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853994790] [2022-04-15 05:41:49,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853994790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:49,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:49,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925403369] [2022-04-15 05:41:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925403369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140250666] [2022-04-15 05:41:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:41:49,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:49,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:41:49,954 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,060 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 05:41:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:41:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:41:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 05:41:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 05:41:50,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-15 05:41:50,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:50,097 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:41:50,097 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:41:50,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:50,100 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:50,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:41:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 05:41:50,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:50,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:50,122 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:50,123 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,124 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 05:41:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 05:41:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:50,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-15 05:41:50,127 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-15 05:41:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:50,129 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 05:41:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 05:41:50,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:50,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:50,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:50,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 05:41:50,131 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-15 05:41:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:50,132 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 05:41:50,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:50,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 05:41:50,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 05:41:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:41:50,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:50,161 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:50,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:50,161 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2022-04-15 05:41:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:50,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790953394] [2022-04-15 05:41:50,170 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:50,170 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:50,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 2 times [2022-04-15 05:41:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:50,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192206200] [2022-04-15 05:41:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 05:41:50,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 05:41:50,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 05:41:50,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:50,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 05:41:50,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 05:41:50,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 05:41:50,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 05:41:50,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {428#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} is VALID [2022-04-15 05:41:50,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {429#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:50,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {430#(and (<= (+ main_~i~0 4) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(and (<= (+ main_~i~0 4) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {424#false} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#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); {424#false} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {424#false} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {424#false} is VALID [2022-04-15 05:41:50,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#false} assume !(~i~0 >= 0); {424#false} is VALID [2022-04-15 05:41:50,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#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; {424#false} is VALID [2022-04-15 05:41:50,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {424#false} is VALID [2022-04-15 05:41:50,314 INFO L272 TraceCheckUtils]: 15: Hoare triple {424#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {424#false} is VALID [2022-04-15 05:41:50,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-15 05:41:50,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-15 05:41:50,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 05:41:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192206200] [2022-04-15 05:41:50,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192206200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027459317] [2022-04-15 05:41:50,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:50,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:50,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:50,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:41:50,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:50,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:50,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:41:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:50,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:41:50,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 05:41:51,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:51,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:51,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 05:41:51,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 05:41:51,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 05:41:51,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 05:41:51,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 05:41:51,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 05:41:51,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:51,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:51,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:51,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:51,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {463#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:41:51,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {467#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:51,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {471#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} is VALID [2022-04-15 05:41:51,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} assume !(~i~0 >= 0); {475#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:41:51,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~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; {479#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:41:51,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {479#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {483#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:51,509 INFO L272 TraceCheckUtils]: 15: Hoare triple {483#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:51,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:51,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 05:41:51,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 05:41:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:51,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:51,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:51,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:41:51,835 INFO L356 Elim1Store]: treesize reduction 26, result has 39.5 percent of original size [2022-04-15 05:41:51,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 102 [2022-04-15 05:41:51,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:51,905 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 05:41:51,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:41:51,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:51,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:41:51,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:51,949 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 05:41:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:41:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:51,988 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:41:51,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 89 [2022-04-15 05:41:52,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 05:41:52,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 05:41:52,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:52,867 INFO L272 TraceCheckUtils]: 15: Hoare triple {483#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:52,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {483#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:52,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {510#(= (select (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|)))} is VALID [2022-04-15 05:41:52,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {518#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {514#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:41:52,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {522#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {518#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:41:52,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {522#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#true} 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); {526#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {423#true} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {423#true} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {423#true} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {423#true} is VALID [2022-04-15 05:41:52,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret13 := main(); {423#true} is VALID [2022-04-15 05:41:52,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 05:41:52,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {423#true} is VALID [2022-04-15 05:41:52,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 05:41:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:52,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027459317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:52,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:52,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 20 [2022-04-15 05:41:52,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790953394] [2022-04-15 05:41:52,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790953394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:52,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:52,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48238609] [2022-04-15 05:41:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:41:52,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:52,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:52,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:52,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:41:52,892 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,063 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 05:41:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:53,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:41:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 05:41:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 05:41:53,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 05:41:53,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:53,101 INFO L225 Difference]: With dead ends: 42 [2022-04-15 05:41:53,101 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:41:53,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:41:53,102 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:53,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:41:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 05:41:53,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:53,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:53,124 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:53,124 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,125 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 05:41:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 05:41:53,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 05:41:53,126 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 05:41:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,127 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 05:41:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 05:41:53,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:53,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 05:41:53,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-04-15 05:41:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:53,128 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 05:41:53,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 05:41:53,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:41:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:41:53,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:53,154 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:53,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:53,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:53,373 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 3 times [2022-04-15 05:41:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497517059] [2022-04-15 05:41:53,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:53,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:53,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 4 times [2022-04-15 05:41:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:53,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435795269] [2022-04-15 05:41:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {753#true} is VALID [2022-04-15 05:41:53,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} assume true; {753#true} is VALID [2022-04-15 05:41:53,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753#true} {753#true} #67#return; {753#true} is VALID [2022-04-15 05:41:53,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:53,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {753#true} is VALID [2022-04-15 05:41:53,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume true; {753#true} is VALID [2022-04-15 05:41:53,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753#true} {753#true} #67#return; {753#true} is VALID [2022-04-15 05:41:53,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret13 := main(); {753#true} is VALID [2022-04-15 05:41:53,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {758#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} is VALID [2022-04-15 05:41:53,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {758#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {759#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:53,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {760#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:53,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {760#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:53,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {761#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#(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); {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#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); {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#false} assume !(~i~0 >= 0); {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#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; {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {754#false} is VALID [2022-04-15 05:41:53,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {754#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} ~cond := #in~cond; {754#false} is VALID [2022-04-15 05:41:53,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume 0 == ~cond; {754#false} is VALID [2022-04-15 05:41:53,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-04-15 05:41:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435795269] [2022-04-15 05:41:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435795269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465346977] [2022-04-15 05:41:53,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:53,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:53,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:41:53,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:53,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:41:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:53,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:41:53,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 05:41:54,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:54,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:54,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 05:41:54,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2022-04-15 05:41:54,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {753#true} is VALID [2022-04-15 05:41:54,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume true; {753#true} is VALID [2022-04-15 05:41:54,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753#true} {753#true} #67#return; {753#true} is VALID [2022-04-15 05:41:54,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret13 := main(); {753#true} is VALID [2022-04-15 05:41:54,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {800#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:41:54,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {804#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {808#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:54,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {812#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:41:54,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~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; {816#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:41:54,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {820#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:54,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {820#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:54,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:54,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {754#false} is VALID [2022-04-15 05:41:54,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-04-15 05:41:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:41:54,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:54,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:54,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:41:54,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,604 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:41:54,604 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-04-15 05:41:54,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 17 [2022-04-15 05:41:54,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:41:54,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,651 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-04-15 05:41:54,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:41:54,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,680 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:41:54,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 42 [2022-04-15 05:41:54,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,705 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 05:41:54,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:54,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:41:54,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,769 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 16 [2022-04-15 05:41:54,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:41:54,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,799 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:41:54,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 39 [2022-04-15 05:41:54,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2022-04-15 05:41:54,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,841 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-04-15 05:41:54,841 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-04-15 05:41:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,850 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 05:41:54,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:54,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:55,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-04-15 05:41:55,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {754#false} is VALID [2022-04-15 05:41:55,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:55,704 INFO L272 TraceCheckUtils]: 17: Hoare triple {820#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:55,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {820#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:55,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {851#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {847#(= (select (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|)))} is VALID [2022-04-15 05:41:55,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {851#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:41:55,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {855#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:41:55,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {863#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {859#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#true} 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); {863#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {753#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {753#true} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {753#true} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {753#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {753#true} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {753#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {753#true} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {753#true} is VALID [2022-04-15 05:41:55,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {753#true} is VALID [2022-04-15 05:41:55,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret13 := main(); {753#true} is VALID [2022-04-15 05:41:55,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753#true} {753#true} #67#return; {753#true} is VALID [2022-04-15 05:41:55,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume true; {753#true} is VALID [2022-04-15 05:41:55,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {753#true} is VALID [2022-04-15 05:41:55,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2022-04-15 05:41:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:41:55,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465346977] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:55,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:55,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 21 [2022-04-15 05:41:55,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:55,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497517059] [2022-04-15 05:41:55,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497517059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101699867] [2022-04-15 05:41:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:41:55,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:55,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:55,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:41:55,730 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,991 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 05:41:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:41:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 05:41:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 05:41:55,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 05:41:56,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,033 INFO L225 Difference]: With dead ends: 44 [2022-04-15 05:41:56,033 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 05:41:56,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:41:56,036 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:56,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 05:41:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 05:41:56,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:56,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:56,066 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:56,066 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,067 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 05:41:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 05:41:56,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 05:41:56,067 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 05:41:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,068 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 05:41:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 05:41:56,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:56,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 05:41:56,069 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-04-15 05:41:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:56,070 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 05:41:56,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 05:41:56,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 05:41:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:41:56,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,101 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:56,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:56,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 05:41:56,320 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 5 times [2022-04-15 05:41:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389982524] [2022-04-15 05:41:56,324 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:56,324 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:56,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 6 times [2022-04-15 05:41:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933607909] [2022-04-15 05:41:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1110#true} is VALID [2022-04-15 05:41:56,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-15 05:41:56,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1110#true} {1110#true} #67#return; {1110#true} is VALID [2022-04-15 05:41:56,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:56,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1110#true} is VALID [2022-04-15 05:41:56,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-15 05:41:56,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #67#return; {1110#true} is VALID [2022-04-15 05:41:56,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret13 := main(); {1110#true} is VALID [2022-04-15 05:41:56,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1115#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} is VALID [2022-04-15 05:41:56,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1116#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:56,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1117#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:56,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {1117#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1117#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:56,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(and (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1118#(and (<= (+ main_~i~0 3) main_~max~0) (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0))} is VALID [2022-04-15 05:41:56,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(and (<= (+ main_~i~0 3) main_~max~0) (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1118#(and (<= (+ main_~i~0 3) main_~max~0) (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0))} is VALID [2022-04-15 05:41:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(and (<= (+ main_~i~0 3) main_~max~0) (<= 2 main_~i~0) (<= (div main_~max~0 4294967296) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1119#(and (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~max~0))} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#(and (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {1111#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); {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1111#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {1111#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {1111#false} assume !(~i~0 >= 0); {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {1111#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; {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L272 TraceCheckUtils]: 19: Hoare triple {1111#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-15 05:41:56,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-15 05:41:56,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-15 05:41:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933607909] [2022-04-15 05:41:56,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933607909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524170319] [2022-04-15 05:41:56,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:56,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 05:41:56,534 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:41:56,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:56,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:41:56,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2022-04-15 05:41:56,657 INFO L390 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 15 treesize of output 14 [2022-04-15 05:41:56,664 INFO L390 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 14 treesize of output 13 [2022-04-15 05:41:56,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:56,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:56,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:56,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-04-15 05:41:57,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:57,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:57,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2022-04-15 05:41:57,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-15 05:41:57,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1110#true} is VALID [2022-04-15 05:41:57,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-15 05:41:57,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #67#return; {1110#true} is VALID [2022-04-15 05:41:57,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret13 := main(); {1110#true} is VALID [2022-04-15 05:41:57,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1139#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {1164#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset| (- 4294967296))) 0)) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:41:57,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {1164#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset| (- 4294967296))) 0)) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|)) 0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1168#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1172#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:57,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1176#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:41:57,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~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; {1180#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:41:57,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {1180#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1184#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem10| 0))} is VALID [2022-04-15 05:41:57,428 INFO L272 TraceCheckUtils]: 19: Hoare triple {1184#(and (= |main_#t~mem11| |main_#t~mem10|) (= |main_#t~mem10| 0))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1188#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:57,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1192#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:57,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {1192#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-04-15 05:41:57,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-15 05:41:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:41:57,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,822 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 05:41:57,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 1 [2022-04-15 05:41:57,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-15 05:41:57,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {1192#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-04-15 05:41:57,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1192#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:57,848 INFO L272 TraceCheckUtils]: 19: Hoare triple {1208#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1188#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:57,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1212#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1208#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:57,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {1216#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {1212#(= (select (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|)))} is VALID [2022-04-15 05:41:57,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1216#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:41:57,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1224#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1220#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:41:57,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (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|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |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|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (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|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 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|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1224#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:57,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#true} 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); {1228#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (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|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |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|))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (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|))) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 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|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {1110#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {1110#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret13 := main(); {1110#true} is VALID [2022-04-15 05:41:57,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #67#return; {1110#true} is VALID [2022-04-15 05:41:57,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-15 05:41:57,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1110#true} is VALID [2022-04-15 05:41:57,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-15 05:41:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:41:57,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524170319] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:57,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:57,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 23 [2022-04-15 05:41:57,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:57,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389982524] [2022-04-15 05:41:57,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389982524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:57,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:57,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281750408] [2022-04-15 05:41:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:41:57,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:57,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:57,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:41:57,872 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,086 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 05:41:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:41:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 05:41:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 05:41:58,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-15 05:41:58,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:58,137 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:41:58,137 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 05:41:58,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-04-15 05:41:58,138 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:58,139 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 05:41:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 05:41:58,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:58,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:58,172 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,173 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 05:41:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 05:41:58,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-04-15 05:41:58,173 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-04-15 05:41:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,174 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 05:41:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 05:41:58,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:58,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 05:41:58,175 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-04-15 05:41:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:58,175 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 05:41:58,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 05:41:58,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 05:41:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:58,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:58,203 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:58,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:58,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:58,420 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 7 times [2022-04-15 05:41:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60905303] [2022-04-15 05:41:58,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:58,423 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:58,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 8 times [2022-04-15 05:41:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:58,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689613748] [2022-04-15 05:41:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 05:41:58,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 05:41:58,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #67#return; {1495#true} is VALID [2022-04-15 05:41:58,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:58,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 05:41:58,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 05:41:58,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #67#return; {1495#true} is VALID [2022-04-15 05:41:58,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret13 := main(); {1495#true} is VALID [2022-04-15 05:41:58,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1500#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} is VALID [2022-04-15 05:41:58,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1500#(and (<= 5 main_~max~0) (<= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1501#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:58,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#(and (<= 5 main_~max~0) (<= (div main_~max~0 4294967296) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1502#(and (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 3)) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2022-04-15 05:41:58,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1502#(and (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 3)) (<= (+ main_~i~0 4) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1502#(and (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 3)) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2022-04-15 05:41:58,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1502#(and (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 3)) (<= (+ main_~i~0 4) main_~max~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1503#(and (<= (+ main_~i~0 3) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 2)))} is VALID [2022-04-15 05:41:58,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1503#(and (<= (+ main_~i~0 3) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 2)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1503#(and (<= (+ main_~i~0 3) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 2)))} is VALID [2022-04-15 05:41:58,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#(and (<= (+ main_~i~0 3) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 2)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1504#(and (<= (+ main_~i~0 2) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 1)))} is VALID [2022-04-15 05:41:58,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#(and (<= (+ main_~i~0 2) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1504#(and (<= (+ main_~i~0 2) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 1)))} is VALID [2022-04-15 05:41:58,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#(and (<= (+ main_~i~0 2) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) (+ main_~i~0 1)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1505#(and (<= (+ main_~i~0 1) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) main_~i~0))} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {1505#(and (<= (+ main_~i~0 1) main_~max~0) (<= (* (div main_~max~0 4294967296) 4294967296) main_~i~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1496#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); {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1496#false} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1496#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1496#false} assume !(~i~0 >= 0); {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1496#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; {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1496#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1496#false} is VALID [2022-04-15 05:41:58,586 INFO L272 TraceCheckUtils]: 21: Hoare triple {1496#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1496#false} is VALID [2022-04-15 05:41:58,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2022-04-15 05:41:58,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 05:41:58,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 05:41:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:58,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689613748] [2022-04-15 05:41:58,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689613748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:58,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138164319] [2022-04-15 05:41:58,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:58,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 05:41:58,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:58,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:58,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:41:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:58,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:41:58,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 05:41:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:41:59,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 05:41:59,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2022-04-15 05:41:59,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 05:41:59,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 05:41:59,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #67#return; {1495#true} is VALID [2022-04-15 05:41:59,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret13 := main(); {1495#true} is VALID [2022-04-15 05:41:59,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1525#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {1556#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:41:59,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {1556#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1560#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:41:59,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1564#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} is VALID [2022-04-15 05:41:59,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {1564#(and (= |main_~#str2~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))))} assume !(~i~0 >= 0); {1568#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:41:59,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~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; {1572#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:41:59,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1576#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:41:59,481 INFO L272 TraceCheckUtils]: 21: Hoare triple {1576#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:59,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:59,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {1584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 05:41:59,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 05:41:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:41:59,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:59,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:59,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:41:59,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,743 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 05:41:59,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:41:59,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 17 [2022-04-15 05:41:59,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,795 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:41:59,795 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-04-15 05:41:59,829 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 05:41:59,829 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-04-15 05:41:59,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,853 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 05:41:59,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 1 [2022-04-15 05:41:59,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,862 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-04-15 05:41:59,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:59,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:41:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,924 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:41:59,924 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-04-15 05:41:59,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2022-04-15 05:41:59,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:41:59,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:59,978 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 05:41:59,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:42:00,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:00,002 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-04-15 05:42:00,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:00,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:00,025 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:42:00,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 79 [2022-04-15 05:42:00,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 05:42:00,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {1584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 05:42:00,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:00,361 INFO L272 TraceCheckUtils]: 21: Hoare triple {1576#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:00,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1576#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:00,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {1607#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {1603#(= (select (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|)))} is VALID [2022-04-15 05:42:00,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {1607#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:00,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {1615#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1611#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:42:00,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1615#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:00,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {1495#true} 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); {1619#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {1495#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {1495#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1495#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1495#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {1495#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {1495#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret13 := main(); {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #67#return; {1495#true} is VALID [2022-04-15 05:42:00,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 05:42:00,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 05:42:00,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2022-04-15 05:42:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:42:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138164319] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:00,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:00,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 23 [2022-04-15 05:42:00,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:00,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60905303] [2022-04-15 05:42:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60905303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:00,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:00,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71676133] [2022-04-15 05:42:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:42:00,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:00,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:00,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:00,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:00,396 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,725 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 05:42:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:42:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:42:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 05:42:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 05:42:00,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-15 05:42:00,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,785 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:42:00,785 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:42:00,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:42:00,786 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:00,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:42:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 05:42:00,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:00,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:00,829 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:00,829 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,830 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 05:42:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 05:42:00,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:42:00,831 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:42:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,832 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 05:42:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 05:42:00,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:00,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 05:42:00,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-04-15 05:42:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:00,833 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 05:42:00,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 05:42:00,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 05:42:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:42:00,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:00,867 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:00,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:01,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,083 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:01,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 9 times [2022-04-15 05:42:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:01,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190464022] [2022-04-15 05:42:01,087 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:01,087 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:01,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 10 times [2022-04-15 05:42:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251576778] [2022-04-15 05:42:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1906#true} {1906#true} #67#return; {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:01,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #67#return; {1906#true} is VALID [2022-04-15 05:42:01,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret13 := main(); {1906#true} is VALID [2022-04-15 05:42:01,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1911#(and (<= 5 main_~max~0) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:01,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1911#(and (<= 5 main_~max~0) (<= 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); {1912#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1912#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1912#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1912#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1913#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {1913#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {1907#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; {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1907#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L272 TraceCheckUtils]: 23: Hoare triple {1907#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1907#false} ~cond := #in~cond; {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {1907#false} assume 0 == ~cond; {1907#false} is VALID [2022-04-15 05:42:01,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2022-04-15 05:42:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251576778] [2022-04-15 05:42:01,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251576778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515572398] [2022-04-15 05:42:01,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:01,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:01,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:01,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:42:01,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:01,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:01,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:42:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:01,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:01,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-15 05:42:02,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:02,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:02,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-04-15 05:42:02,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2022-04-15 05:42:02,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-15 05:42:02,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-15 05:42:02,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #67#return; {1906#true} is VALID [2022-04-15 05:42:02,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret13 := main(); {1906#true} is VALID [2022-04-15 05:42:02,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {1933#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {1970#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:02,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {1970#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1974#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {1974#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {1978#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:02,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {1978#(and (= |main_~#str2~0.offset| 0) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {1982#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:02,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {1982#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (mod (+ main_~max~0 4294967295) 4294967296) 1))} ~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; {1986#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:42:02,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {1986#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< (mod main_~j~0 4294967296) 1) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1990#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:02,117 INFO L272 TraceCheckUtils]: 23: Hoare triple {1990#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1994#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:02,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {1994#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1998#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:02,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1907#false} is VALID [2022-04-15 05:42:02,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2022-04-15 05:42:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:02,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:02,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:02,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:42:02,371 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 05:42:02,372 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-04-15 05:42:02,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:02,404 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:42:02,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 81 [2022-04-15 05:42:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:02,450 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-04-15 05:42:02,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:42:02,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:02,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:42:02,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:02,521 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-15 05:42:02,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:42:02,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:02,551 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:42:02,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 89 [2022-04-15 05:42:02,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2022-04-15 05:42:02,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1907#false} is VALID [2022-04-15 05:42:02,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {1994#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1998#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:02,903 INFO L272 TraceCheckUtils]: 23: Hoare triple {1990#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1994#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:02,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {2017#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1990#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:02,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {2021#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {2017#(= (select (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|)))} is VALID [2022-04-15 05:42:02,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2025#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {2021#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:02,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2025#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:42:02,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {2033#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2029#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:02,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1906#true} 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); {2033#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ main_~i~0 |main_~#str1~0.offset| 4294967296)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:02,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1906#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1906#true} is VALID [2022-04-15 05:42:02,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1906#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {1906#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1906#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {1906#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {1906#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {1906#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {1906#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1906#true} is VALID [2022-04-15 05:42:02,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {1906#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {1906#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret13 := main(); {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #67#return; {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2022-04-15 05:42:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:02,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515572398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:02,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:02,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 20 [2022-04-15 05:42:02,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:02,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190464022] [2022-04-15 05:42:02,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190464022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:02,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:02,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793272331] [2022-04-15 05:42:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 05:42:02,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:02,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:02,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:02,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:42:02,933 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,189 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 05:42:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 05:42:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 05:42:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 05:42:03,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 05:42:03,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:03,224 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:42:03,224 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 05:42:03,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:03,225 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:03,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 05:42:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 05:42:03,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:03,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:03,277 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:03,277 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,278 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 05:42:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 05:42:03,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:42:03,278 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:42:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,279 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 05:42:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 05:42:03,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:03,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-15 05:42:03,280 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2022-04-15 05:42:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:03,280 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-15 05:42:03,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:03,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-15 05:42:03,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 05:42:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:42:03,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:03,317 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:03,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 05:42:03,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:03,531 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 11 times [2022-04-15 05:42:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:03,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872277893] [2022-04-15 05:42:03,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:03,535 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:03,535 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 12 times [2022-04-15 05:42:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183816774] [2022-04-15 05:42:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {2336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2326#true} is VALID [2022-04-15 05:42:03,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-04-15 05:42:03,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2326#true} {2326#true} #67#return; {2326#true} is VALID [2022-04-15 05:42:03,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {2326#true} call ULTIMATE.init(); {2336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:03,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2326#true} is VALID [2022-04-15 05:42:03,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-04-15 05:42:03,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2326#true} {2326#true} #67#return; {2326#true} is VALID [2022-04-15 05:42:03,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {2326#true} call #t~ret13 := main(); {2326#true} is VALID [2022-04-15 05:42:03,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:03,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {2331#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} 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); {2332#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:03,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {2332#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2332#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:03,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {2332#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2333#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:03,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {2333#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2334#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {2334#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2335#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {2335#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {2327#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; {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {2327#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L272 TraceCheckUtils]: 25: Hoare triple {2327#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {2327#false} ~cond := #in~cond; {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {2327#false} assume 0 == ~cond; {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-04-15 05:42:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183816774] [2022-04-15 05:42:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183816774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196127277] [2022-04-15 05:42:03,723 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:03,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:03,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:42:03,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:42:03,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:03,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:42:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:03,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {2326#true} call ULTIMATE.init(); {2326#true} is VALID [2022-04-15 05:42:03,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2326#true} is VALID [2022-04-15 05:42:03,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-04-15 05:42:03,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2326#true} {2326#true} #67#return; {2326#true} is VALID [2022-04-15 05:42:03,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2326#true} call #t~ret13 := main(); {2326#true} is VALID [2022-04-15 05:42:03,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {2355#(= 5 main_~max~0)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {2355#(= 5 main_~max~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {2355#(= 5 main_~max~0)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {2355#(= 5 main_~max~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {2355#(= 5 main_~max~0)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {2355#(= 5 main_~max~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {2355#(= 5 main_~max~0)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {2355#(= 5 main_~max~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {2355#(= 5 main_~max~0)} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {2355#(= 5 main_~max~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {2355#(= 5 main_~max~0)} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2355#(= 5 main_~max~0)} is VALID [2022-04-15 05:42:03,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {2355#(= 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); {2392#(= main_~i~0 4)} is VALID [2022-04-15 05:42:03,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {2392#(= main_~i~0 4)} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2392#(= main_~i~0 4)} is VALID [2022-04-15 05:42:03,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {2392#(= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2399#(= 4 (+ main_~i~0 1))} is VALID [2022-04-15 05:42:03,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {2399#(= 4 (+ main_~i~0 1))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2399#(= 4 (+ main_~i~0 1))} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {2399#(= 4 (+ main_~i~0 1))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2406#(<= 2 main_~i~0)} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {2406#(<= 2 main_~i~0)} assume !(~i~0 >= 0); {2327#false} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {2327#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; {2327#false} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {2327#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2327#false} is VALID [2022-04-15 05:42:03,939 INFO L272 TraceCheckUtils]: 25: Hoare triple {2327#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2327#false} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {2327#false} ~cond := #in~cond; {2327#false} is VALID [2022-04-15 05:42:03,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {2327#false} assume 0 == ~cond; {2327#false} is VALID [2022-04-15 05:42:03,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-04-15 05:42:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:03,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:04,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-04-15 05:42:04,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {2327#false} assume 0 == ~cond; {2327#false} is VALID [2022-04-15 05:42:04,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {2327#false} ~cond := #in~cond; {2327#false} is VALID [2022-04-15 05:42:04,203 INFO L272 TraceCheckUtils]: 25: Hoare triple {2327#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2327#false} is VALID [2022-04-15 05:42:04,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {2327#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2327#false} is VALID [2022-04-15 05:42:04,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {2327#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; {2327#false} is VALID [2022-04-15 05:42:04,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {2446#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {2327#false} is VALID [2022-04-15 05:42:04,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#(<= 1 main_~i~0)} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2446#(<= 0 main_~i~0)} is VALID [2022-04-15 05:42:04,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {2454#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2450#(<= 1 main_~i~0)} is VALID [2022-04-15 05:42:04,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {2458#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2454#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:04,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {2458#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2458#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:04,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} 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); {2458#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:04,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2465#(or (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (not (<= 1 (mod (+ main_~max~0 4294967295) 4294967296))))} is VALID [2022-04-15 05:42:04,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2326#true} call #t~ret13 := main(); {2326#true} is VALID [2022-04-15 05:42:04,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2326#true} {2326#true} #67#return; {2326#true} is VALID [2022-04-15 05:42:04,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-04-15 05:42:04,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2326#true} is VALID [2022-04-15 05:42:04,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {2326#true} call ULTIMATE.init(); {2326#true} is VALID [2022-04-15 05:42:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:04,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196127277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:04,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:04,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2022-04-15 05:42:04,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:04,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872277893] [2022-04-15 05:42:04,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872277893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:04,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:04,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309147215] [2022-04-15 05:42:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:04,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 05:42:04,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:04,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:04,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:04,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:42:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:42:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 05:42:04,229 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:04,632 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-04-15 05:42:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:42:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 05:42:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 05:42:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 05:42:04,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 05:42:04,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:04,686 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:42:04,686 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 05:42:04,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:42:04,687 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:04,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 38 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 05:42:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-15 05:42:04,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:04,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:04,756 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:04,756 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:04,757 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 05:42:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 05:42:04,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:04,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:04,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-15 05:42:04,758 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-15 05:42:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:04,759 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 05:42:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 05:42:04,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:04,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:04,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:04,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 05:42:04,760 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2022-04-15 05:42:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:04,760 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 05:42:04,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:04,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 05:42:04,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 05:42:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:42:04,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:04,800 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:04,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:05,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,001 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 13 times [2022-04-15 05:42:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:05,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966518997] [2022-04-15 05:42:05,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:05,005 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:05,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 14 times [2022-04-15 05:42:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:05,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877682937] [2022-04-15 05:42:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {2782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2771#true} is VALID [2022-04-15 05:42:05,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {2771#true} assume true; {2771#true} is VALID [2022-04-15 05:42:05,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2771#true} {2771#true} #67#return; {2771#true} is VALID [2022-04-15 05:42:05,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {2782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2771#true} is VALID [2022-04-15 05:42:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2022-04-15 05:42:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #67#return; {2771#true} is VALID [2022-04-15 05:42:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret13 := main(); {2771#true} is VALID [2022-04-15 05:42:05,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {2771#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:05,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {2776#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} 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); {2777#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:05,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {2777#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2777#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:05,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {2777#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2778#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:05,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {2778#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2778#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:05,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {2778#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2779#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 05:42:05,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {2779#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2780#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:05,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {2780#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2781#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {2781#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {2772#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; {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {2772#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L272 TraceCheckUtils]: 27: Hoare triple {2772#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {2772#false} ~cond := #in~cond; {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {2772#false} assume 0 == ~cond; {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2022-04-15 05:42:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:05,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877682937] [2022-04-15 05:42:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877682937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:05,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708589374] [2022-04-15 05:42:05,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:05,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:05,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:05,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:42:05,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:05,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:05,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 05:42:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:05,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:05,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 05:42:07,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:07,597 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 05:42:07,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 05:42:08,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2771#true} is VALID [2022-04-15 05:42:08,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {2771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2771#true} is VALID [2022-04-15 05:42:08,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2022-04-15 05:42:08,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #67#return; {2771#true} is VALID [2022-04-15 05:42:08,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret13 := main(); {2771#true} is VALID [2022-04-15 05:42:08,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {2771#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2801#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {2801#(and (= |main_~#str1~0.offset| 0) (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); {2838#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:08,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {2838#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2842#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:08,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {2842#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2846#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {2846#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2850#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2854#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {2854#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2858#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {2858#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2862#(and (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-15 05:42:08,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {2862#(and (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296)) (+ main_~i~0 1)))} assume !(~i~0 >= 0); {2866#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 3) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str1~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:08,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {2866#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 3) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod (+ main_~max~0 4294967295) 4294967296) |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; {2870#(and (< (div (+ (- 2) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 2 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod main_~j~0 4294967296) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:08,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {2870#(and (< (div (+ (- 2) main_~j~0) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 2 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 2 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (- 2) (mod main_~j~0 4294967296) |main_~#str1~0.offset|))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2874#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:08,020 INFO L272 TraceCheckUtils]: 27: Hoare triple {2874#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:08,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:08,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {2882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2772#false} is VALID [2022-04-15 05:42:08,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2022-04-15 05:42:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:08,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:08,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:08,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:42:08,362 INFO L356 Elim1Store]: treesize reduction 27, result has 34.1 percent of original size [2022-04-15 05:42:08,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 45 [2022-04-15 05:42:08,393 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-15 05:42:08,393 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-04-15 05:42:08,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:08,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:42:08,474 INFO L356 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-04-15 05:42:08,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2022-04-15 05:42:08,505 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-15 05:42:08,505 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-04-15 05:42:08,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2022-04-15 05:42:08,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {2882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2772#false} is VALID [2022-04-15 05:42:08,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:08,924 INFO L272 TraceCheckUtils]: 27: Hoare triple {2874#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:08,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {2901#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {2874#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:08,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {2901#(= (select (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|)))} is VALID [2022-04-15 05:42:08,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {2909#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {2905#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:08,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {2913#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2909#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:42:08,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {2917#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2913#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:08,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2917#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:08,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2921#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:08,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {2925#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:08,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {2933#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2929#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {2771#true} 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); {2933#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {2771#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {2771#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {2771#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {2771#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2771#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2022-04-15 05:42:08,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {2771#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {2771#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {2771#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {2771#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret13 := main(); {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #67#return; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2771#true} is VALID [2022-04-15 05:42:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:08,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708589374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:08,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 31 [2022-04-15 05:42:08,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:08,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966518997] [2022-04-15 05:42:08,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966518997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:08,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:08,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684941400] [2022-04-15 05:42:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 05:42:08,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:08,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:08,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:08,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:42:08,954 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:09,459 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-04-15 05:42:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:42:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 05:42:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 05:42:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 05:42:09,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 05:42:09,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:09,498 INFO L225 Difference]: With dead ends: 50 [2022-04-15 05:42:09,498 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:42:09,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 05:42:09,499 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:09,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:42:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-15 05:42:09,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:09,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:09,573 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:09,573 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:09,574 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 05:42:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 05:42:09,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:09,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:09,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 05:42:09,575 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 05:42:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:09,575 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 05:42:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 05:42:09,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:09,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:09,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:09,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 05:42:09,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2022-04-15 05:42:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:09,577 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 05:42:09,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:09,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 05:42:09,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 05:42:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 05:42:09,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:09,619 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:09,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:09,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:09,820 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 15 times [2022-04-15 05:42:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019066623] [2022-04-15 05:42:09,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:09,824 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:09,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 16 times [2022-04-15 05:42:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269247452] [2022-04-15 05:42:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:10,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {3268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3256#true} is VALID [2022-04-15 05:42:10,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-15 05:42:10,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3256#true} {3256#true} #67#return; {3256#true} is VALID [2022-04-15 05:42:10,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:10,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {3268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3256#true} is VALID [2022-04-15 05:42:10,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-15 05:42:10,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #67#return; {3256#true} is VALID [2022-04-15 05:42:10,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret13 := main(); {3256#true} is VALID [2022-04-15 05:42:10,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2022-04-15 05:42:10,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {3261#(and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} 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); {3262#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:10,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {3262#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3262#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:10,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {3262#(and (or (and (<= 5 main_~max~0) (<= (div (+ main_~max~0 4294967295) 4294967296) 1)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3263#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:10,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {3263#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3263#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:10,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {3263#(or (<= (+ main_~i~0 2) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3264#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 05:42:10,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {3264#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3264#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} is VALID [2022-04-15 05:42:10,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {3264#(or (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~i~0 3) 0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3265#(or (<= (+ main_~i~0 4) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:10,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {3265#(or (<= (+ main_~i~0 4) 0) (and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3266#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967297 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3267#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {3267#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {3257#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; {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {3257#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L272 TraceCheckUtils]: 29: Hoare triple {3257#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {3257#false} ~cond := #in~cond; {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {3257#false} assume 0 == ~cond; {3257#false} is VALID [2022-04-15 05:42:10,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-15 05:42:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:10,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269247452] [2022-04-15 05:42:10,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269247452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:10,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318249466] [2022-04-15 05:42:10,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:10,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:10,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:10,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:10,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:42:10,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:10,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:10,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 05:42:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:10,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:10,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 05:42:11,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:11,830 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 05:42:11,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 13 [2022-04-15 05:42:12,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-15 05:42:12,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3256#true} is VALID [2022-04-15 05:42:12,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-15 05:42:12,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #67#return; {3256#true} is VALID [2022-04-15 05:42:12,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret13 := main(); {3256#true} is VALID [2022-04-15 05:42:12,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3287#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {3287#(and (= |main_~#str1~0.offset| 0) (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); {3324#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:12,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {3324#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3328#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:12,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {3328#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3332#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {3332#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3336#(and (= (+ (- 2) main_~j~0) 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {3336#(and (= (+ (- 2) main_~j~0) 0) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3340#(and (= (+ (- 2) main_~j~0) 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {3340#(and (= (+ (- 2) main_~j~0) 0) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3344#(and (= main_~j~0 3) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {3344#(and (= main_~j~0 3) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3348#(and (= main_~j~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:12,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {3348#(and (= main_~j~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3352#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:12,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {3352#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3356#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4)) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {3356#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4)) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {3360#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {3360#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 4) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 3) |main_~#str1~0.offset|))) (<= 3 (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.offset| 0) (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; {3364#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (<= 3 (mod main_~j~0 4294967296)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 3) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:12,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {3364#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (<= 3 (mod main_~j~0 4294967296)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 3) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ 3 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3368#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:12,119 INFO L272 TraceCheckUtils]: 29: Hoare triple {3368#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:12,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {3372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:12,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {3376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-15 05:42:12,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-15 05:42:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:12,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:12,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:12,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:42:12,482 INFO L356 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2022-04-15 05:42:12,482 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-04-15 05:42:12,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-04-15 05:42:12,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:42:12,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:12,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:42:12,602 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:42:12,602 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-04-15 05:42:12,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-04-15 05:42:12,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:42:13,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-15 05:42:13,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {3376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-15 05:42:13,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {3372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:13,121 INFO L272 TraceCheckUtils]: 29: Hoare triple {3368#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:13,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {3395#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3368#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:13,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {3399#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {3395#(= (select (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|)))} is VALID [2022-04-15 05:42:13,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {3403#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {3399#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:13,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3403#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:42:13,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {3411#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3407#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:13,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {3415#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3411#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:13,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {3419#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3415#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:13,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {3423#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3419#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:13,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {3427#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3423#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:13,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {3431#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3427#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:13,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {3435#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3431#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} 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); {3435#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {3256#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {3256#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {3256#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {3256#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3256#true} is VALID [2022-04-15 05:42:13,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {3256#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {3256#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {3256#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret13 := main(); {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #67#return; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-15 05:42:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:13,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318249466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:13,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:13,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 36 [2022-04-15 05:42:13,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:13,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019066623] [2022-04-15 05:42:13,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019066623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:13,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:42:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280666467] [2022-04-15 05:42:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 05:42:13,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:13,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:13,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:13,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:42:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:42:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:42:13,153 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:13,988 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-15 05:42:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:42:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 05:42:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-15 05:42:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-15 05:42:13,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-04-15 05:42:14,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:14,050 INFO L225 Difference]: With dead ends: 63 [2022-04-15 05:42:14,050 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 05:42:14,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 05:42:14,051 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:14,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:42:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 05:42:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-04-15 05:42:14,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:14,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:14,149 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:14,149 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:14,152 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 05:42:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 05:42:14,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:14,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:14,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-15 05:42:14,152 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-15 05:42:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:14,154 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 05:42:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 05:42:14,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:14,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:14,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:14,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-15 05:42:14,155 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2022-04-15 05:42:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:14,155 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-15 05:42:14,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-15 05:42:14,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 05:42:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 05:42:14,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:14,212 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:14,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:14,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 05:42:14,413 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 17 times [2022-04-15 05:42:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1134041895] [2022-04-15 05:42:14,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:14,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:14,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 18 times [2022-04-15 05:42:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849405226] [2022-04-15 05:42:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {3839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3816#true} is VALID [2022-04-15 05:42:15,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3816#true} assume true; {3816#true} is VALID [2022-04-15 05:42:15,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3816#true} {3816#true} #67#return; {3816#true} is VALID [2022-04-15 05:42:15,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {3816#true} call ULTIMATE.init(); {3839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:15,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3816#true} is VALID [2022-04-15 05:42:15,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {3816#true} assume true; {3816#true} is VALID [2022-04-15 05:42:15,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3816#true} {3816#true} #67#return; {3816#true} is VALID [2022-04-15 05:42:15,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {3816#true} call #t~ret13 := main(); {3816#true} is VALID [2022-04-15 05:42:15,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {3816#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3821#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {3821#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3821#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {3821#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3822#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:15,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {3822#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3822#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:15,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {3822#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3823#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:15,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {3823#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3823#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:15,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {3823#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3824#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:15,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {3824#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3824#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:15,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {3824#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3825#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:15,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {3825#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3825#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:15,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {3825#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3826#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {3826#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3826#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {3826#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:15,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 3 |main_~#str1~0.offset|) (+ |main_~#str1~0.offset| 4)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:15,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {3828#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 3 |main_~#str1~0.offset|) (+ |main_~#str1~0.offset| 4)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {3829#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 3 |main_~#str1~0.offset|)) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (and (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 3 |main_~#str1~0.offset|)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#(and (= |main_~#str2~0.offset| 0) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 2 |main_~#str1~0.offset|) (+ main_~j~0 2 |main_~#str1~0.offset|))) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset| 4294967298) (+ main_~j~0 2 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3831#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {3831#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ main_~j~0 |main_~#str2~0.offset|) (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {3832#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))))) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3833#(and (= |main_~#str2~0.offset| 0) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 05:42:15,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {3833#(and (= |main_~#str2~0.offset| 0) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)))} assume !(~i~0 >= 0); {3834#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {3834#(and (= |main_~#str2~0.offset| 0) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str1~0.base|) 0) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 |main_~#str1~0.offset|))))) (= |main_~#str1~0.offset| 0) (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; {3835#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:15,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3836#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:15,305 INFO L272 TraceCheckUtils]: 31: Hoare triple {3836#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:15,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3838#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:15,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {3838#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3817#false} is VALID [2022-04-15 05:42:15,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {3817#false} assume !false; {3817#false} is VALID [2022-04-15 05:42:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 05:42:15,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:15,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849405226] [2022-04-15 05:42:15,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849405226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:15,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928124284] [2022-04-15 05:42:15,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:15,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:15,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:15,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 05:42:15,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 05:42:15,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:15,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 05:42:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:15,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:16,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 05:42:17,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:17,428 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 05:42:17,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 05:42:17,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {3816#true} call ULTIMATE.init(); {3816#true} is VALID [2022-04-15 05:42:17,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {3816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3816#true} is VALID [2022-04-15 05:42:17,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {3816#true} assume true; {3816#true} is VALID [2022-04-15 05:42:17,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3816#true} {3816#true} #67#return; {3816#true} is VALID [2022-04-15 05:42:17,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {3816#true} call #t~ret13 := main(); {3816#true} is VALID [2022-04-15 05:42:17,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {3816#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3858#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {3858#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3858#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {3858#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3865#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {3865#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3865#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {3865#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3872#(and (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~i~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {3872#(and (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~i~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3872#(and (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~i~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {3872#(and (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~i~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3879#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(and (= main_~i~0 3) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3886#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {3886#(and (= |main_~#str1~0.offset| 0) (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); {3899#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:17,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {3899#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3903#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:17,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {3903#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3907#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {3907#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3911#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-15 05:42:17,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3915#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-15 05:42:17,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {3915#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 1))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3919#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {3919#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3923#(and (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:17,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {3923#(and (= |main_~#str1~0.offset| 0) (= (+ (- 2) main_~j~0) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3927#(and (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:17,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {3927#(and (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3931#(and (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {3931#(and (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ main_~j~0 (- 3)) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3935#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:17,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {3935#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3939#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~i~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:17,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {3939#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~i~0)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {3943#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 5) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:17,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {3943#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (< (mod (+ main_~max~0 4294967295) 4294967296) 5) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 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; {3947#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 05:42:17,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {3947#(and (< (div main_~j~0 (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3836#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:17,830 INFO L272 TraceCheckUtils]: 31: Hoare triple {3836#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:17,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:17,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {3958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3817#false} is VALID [2022-04-15 05:42:17,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {3817#false} assume !false; {3817#false} is VALID [2022-04-15 05:42:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:42:17,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:18,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:18,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2022-04-15 05:42:18,186 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-04-15 05:42:18,186 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-15 05:42:18,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-04-15 05:42:18,220 INFO L356 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2022-04-15 05:42:18,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2022-04-15 05:42:18,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:18,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2022-04-15 05:42:18,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-04-15 05:42:18,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:42:18,355 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:42:18,356 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-04-15 05:42:19,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {3817#false} assume !false; {3817#false} is VALID [2022-04-15 05:42:19,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {3958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3817#false} is VALID [2022-04-15 05:42:19,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:19,037 INFO L272 TraceCheckUtils]: 31: Hoare triple {3836#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:19,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {3977#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {3836#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:19,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {3981#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~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; {3977#(= (select (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|)))} is VALID [2022-04-15 05:42:19,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {3985#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} assume !(~i~0 >= 0); {3981#(and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2022-04-15 05:42:19,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3989#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3985#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 0 main_~i~0))} is VALID [2022-04-15 05:42:19,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {3993#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3989#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:19,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {3993#(or (not (<= 0 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:19,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {4001#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3997#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~j~0)) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:19,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {4005#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4001#(or (<= 2 main_~i~0) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:19,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {4009#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4005#(or (not (<= 2 main_~i~0)) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:19,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {4013#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4009#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:19,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {4017#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4013#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:19,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {4021#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4017#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:19,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(or (not (<= 4 main_~i~0)) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))) (<= 5 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4021#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:19,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {3816#true} 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); {4025#(or (not (<= 4 main_~i~0)) (and (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {3816#true} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {3816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3816#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {3816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {3816#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {3816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {3816#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {3816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {3816#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {3816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {3816#true} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {3816#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {3816#true} call #t~ret13 := main(); {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3816#true} {3816#true} #67#return; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {3816#true} assume true; {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3816#true} is VALID [2022-04-15 05:42:19,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {3816#true} call ULTIMATE.init(); {3816#true} is VALID [2022-04-15 05:42:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928124284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:19,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 18] total 54 [2022-04-15 05:42:19,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:19,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1134041895] [2022-04-15 05:42:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1134041895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:19,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:42:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840208072] [2022-04-15 05:42:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 05:42:19,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:19,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:19,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:19,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:42:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:42:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2504, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:42:19,080 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:22,490 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 05:42:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 05:42:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 05:42:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-15 05:42:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-15 05:42:22,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 70 transitions. [2022-04-15 05:42:22,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:22,582 INFO L225 Difference]: With dead ends: 70 [2022-04-15 05:42:22,582 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 05:42:22,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=849, Invalid=5471, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 05:42:22,584 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:22,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 77 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 05:42:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 05:42:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-04-15 05:42:22,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:22,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:22,727 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:22,727 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:22,728 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-04-15 05:42:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-04-15 05:42:22,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:22,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:22,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 05:42:22,729 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 05:42:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:22,730 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-04-15 05:42:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-04-15 05:42:22,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:22,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:22,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:22,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-04-15 05:42:22,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2022-04-15 05:42:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:22,731 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-04-15 05:42:22,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:22,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2022-04-15 05:42:22,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 05:42:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 05:42:22,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:22,809 INFO L499 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] [2022-04-15 05:42:22,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:23,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:23,009 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2022-04-15 05:42:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:23,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013783645] [2022-04-15 05:42:23,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:23,013 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:23,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 2 times [2022-04-15 05:42:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:23,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806382563] [2022-04-15 05:42:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {4531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-04-15 05:42:24,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:24,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4502#true} {4502#true} #67#return; {4502#true} is VALID [2022-04-15 05:42:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-15 05:42:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {4502#true} ~cond := #in~cond; {4502#true} is VALID [2022-04-15 05:42:24,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} assume !(0 == ~cond); {4502#true} is VALID [2022-04-15 05:42:24,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:24,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {4502#true} call ULTIMATE.init(); {4531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:24,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {4531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-04-15 05:42:24,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:24,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4502#true} #67#return; {4502#true} is VALID [2022-04-15 05:42:24,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {4502#true} call #t~ret13 := main(); {4502#true} is VALID [2022-04-15 05:42:24,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {4502#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {4507#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {4507#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4507#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {4509#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:24,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {4509#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4510#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:24,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {4510#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4511#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:24,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {4511#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4512#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:24,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {4512#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 05:42:24,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 05:42:24,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4515#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {4515#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4516#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {4516#(and (= |main_~#str2~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 1)) (and (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4517#(and (= |main_~#str2~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0) (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {4517#(and (= |main_~#str2~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0) (and (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 3)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4518#(and (= |main_~#str2~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {4518#(and (= |main_~#str2~0.offset| 0) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))))} is VALID [2022-04-15 05:42:24,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {4519#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (and (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))))} assume !(~i~0 >= 0); {4520#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {4520#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (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; {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,284 INFO L272 TraceCheckUtils]: 31: Hoare triple {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4502#true} is VALID [2022-04-15 05:42:24,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {4502#true} ~cond := #in~cond; {4502#true} is VALID [2022-04-15 05:42:24,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {4502#true} assume !(0 == ~cond); {4502#true} is VALID [2022-04-15 05:42:24,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:24,285 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4502#true} {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {4521#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4526#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {4526#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) 1) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4527#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (= (+ main_~i~0 |main_~#str1~0.offset|) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:24,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {4527#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (= (+ main_~i~0 |main_~#str1~0.offset|) 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4528#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:24,291 INFO L272 TraceCheckUtils]: 39: Hoare triple {4528#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:24,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {4529#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4530#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:24,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {4530#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4503#false} is VALID [2022-04-15 05:42:24,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-04-15 05:42:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:42:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806382563] [2022-04-15 05:42:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806382563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261551362] [2022-04-15 05:42:24,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:24,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:24,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:24,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 05:42:24,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:24,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:24,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 05:42:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:24,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:24,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:24,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-04-15 05:42:25,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-04-15 05:42:30,610 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1)))) is different from true [2022-04-15 05:42:35,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:35,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 10 [2022-04-15 05:42:35,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {4502#true} call ULTIMATE.init(); {4502#true} is VALID [2022-04-15 05:42:35,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-04-15 05:42:35,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:35,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4502#true} #67#return; {4502#true} is VALID [2022-04-15 05:42:35,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {4502#true} call #t~ret13 := main(); {4502#true} is VALID [2022-04-15 05:42:35,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {4502#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {4508#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {4509#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:35,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {4509#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4510#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:35,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {4510#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4511#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:35,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4511#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4512#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:42:35,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {4512#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 05:42:35,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 05:42:35,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4604#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} is VALID [2022-04-15 05:42:35,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {4604#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (= (+ main_~j~0 |main_~#str2~0.offset|) 3))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4608#(and (= |main_~#str2~0.offset| 0) (= 3 (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} is VALID [2022-04-15 05:42:35,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {4608#(and (= |main_~#str2~0.offset| 0) (= 3 (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4612#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= 3 (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {4612#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= 3 (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4616#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} is VALID [2022-04-15 05:42:35,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {4616#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4620#(and (= |main_~#str2~0.offset| 0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967290 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 3)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:35,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {4620#(and (= |main_~#str2~0.offset| 0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967290 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) 3)) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 0 (+ main_~i~0 1)) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {4520#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {4520#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (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; {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:42:35,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:42:35,522 INFO L272 TraceCheckUtils]: 31: Hoare triple {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 05:42:35,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 05:42:35,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} assume !(0 == ~cond); {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 05:42:35,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} assume true; {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 05:42:35,524 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4634#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) 1) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) 3)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|))))} {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #65#return; {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:42:35,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {4627#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4650#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (< (+ (div (+ main_~j~0 (- 3)) (- 4294967296)) (div (+ main_~j~0 1) (- 4294967296))) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {4650#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (< (+ (div (+ main_~j~0 (- 3)) (- 4294967296)) (div (+ main_~j~0 1) (- 4294967296))) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4654#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (< main_~j~0 4294967295) (< (+ (div (+ main_~j~0 (- 3)) (- 4294967296)) (div (+ main_~j~0 1) (- 4294967296))) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:35,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {4654#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 3) (select (select |#memory_int| |main_~#str1~0.base|) 1)) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (< main_~j~0 4294967295) (< (+ (div (+ main_~j~0 (- 3)) (- 4294967296)) (div (+ main_~j~0 1) (- 4294967296))) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) (div (+ 3 (* (- 1) main_~j~0)) 4294967296) 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4528#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:35,529 INFO L272 TraceCheckUtils]: 39: Hoare triple {4528#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:35,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:35,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4503#false} is VALID [2022-04-15 05:42:35,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-04-15 05:42:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 2 not checked. [2022-04-15 05:42:35,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:36,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:36,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 05:42:36,444 INFO L356 Elim1Store]: treesize reduction 31, result has 34.0 percent of original size [2022-04-15 05:42:36,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 505 treesize of output 436 [2022-04-15 05:42:36,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:36,591 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-04-15 05:42:36,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 200 [2022-04-15 05:42:36,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:36,711 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 05:42:36,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 05:42:36,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:36,768 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:42:36,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 284 treesize of output 230 [2022-04-15 05:42:36,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:36,882 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 05:42:36,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 05:42:36,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:36,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 05:42:37,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:37,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:37,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 515 treesize of output 440 [2022-04-15 05:42:37,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:37,930 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 05:42:37,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:37,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-04-15 05:42:40,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2022-04-15 05:42:40,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4503#false} is VALID [2022-04-15 05:42:40,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:40,147 INFO L272 TraceCheckUtils]: 39: Hoare triple {4528#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:40,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {4684#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4528#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:40,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {4688#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4684#(= (select (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|)))} is VALID [2022-04-15 05:42:40,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {4688#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:42:40,150 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4502#true} {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} #65#return; {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:42:40,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:40,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {4502#true} assume !(0 == ~cond); {4502#true} is VALID [2022-04-15 05:42:40,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {4502#true} ~cond := #in~cond; {4502#true} is VALID [2022-04-15 05:42:40,150 INFO L272 TraceCheckUtils]: 31: Hoare triple {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4502#true} is VALID [2022-04-15 05:42:40,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:42:40,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {4714#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} ~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; {4692#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:42:40,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {4718#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} assume !(~i~0 >= 0); {4714#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} is VALID [2022-04-15 05:42:40,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {4722#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4718#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 05:42:40,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {4726#(or (not (<= 0 main_~i~0)) (and (or (forall ((v_ArrVal_448 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_448 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |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|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (<= 1 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4722#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 05:42:40,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {4730#(or (<= 2 main_~i~0) (and (or (forall ((v_ArrVal_448 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_448 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |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|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4726#(or (not (<= 0 main_~i~0)) (and (or (forall ((v_ArrVal_448 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_448 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |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|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:40,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {4734#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4730#(or (<= 2 main_~i~0) (and (or (forall ((v_ArrVal_448 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_448 Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_448) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |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|) v_ArrVal_448)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:40,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {4738#(or (not (<= 2 main_~i~0)) (<= 3 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4734#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset| 1) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))))))) (<= 2 main_~i~0) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:42:40,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {4742#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))))))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4738#(or (not (<= 2 main_~i~0)) (<= 3 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) |main_~#str1~0.offset|)))))))))} is VALID [2022-04-15 05:42:40,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {4746#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4742#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (+ main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298))))))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:42:40,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {4750#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4746#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)))))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (or (not (= (+ main_~j~0 |main_~#str2~0.offset| 1) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:40,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {4754#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {4750#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (- 1) main_~i~0 |main_~#str1~0.offset|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))))))))} is VALID [2022-04-15 05:42:40,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {4758#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {4754#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))) (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (or (not (= |main_~#str1~0.offset| (+ main_~j~0 2 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (or (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2022-04-15 05:42:40,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |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); {4758#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))) (or (= (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|) (+ (- 2) main_~i~0 |main_~#str1~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4)))))) (or (and (or (= (+ |main_~#str1~0.offset| 4294967298) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (and (or (not (= |main_~#str1~0.offset| (+ main_~j~0 3 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)))) (or (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (= |main_~#str1~0.base| |main_~#str2~0.base|))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:40,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {4502#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {4762#(or (not (= (+ 3 |main_~#str2~0.offset|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:40,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {4502#true} call #t~ret13 := main(); {4502#true} is VALID [2022-04-15 05:42:40,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4502#true} #67#return; {4502#true} is VALID [2022-04-15 05:42:40,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2022-04-15 05:42:40,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {4502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4502#true} is VALID [2022-04-15 05:42:40,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {4502#true} call ULTIMATE.init(); {4502#true} is VALID [2022-04-15 05:42:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:42:40,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261551362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:40,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:40,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 21] total 50 [2022-04-15 05:42:40,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:40,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013783645] [2022-04-15 05:42:40,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013783645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:40,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:40,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:42:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205687071] [2022-04-15 05:42:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:42:40,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:40,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:40,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:40,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:42:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:42:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2045, Unknown=1, NotChecked=94, Total=2450 [2022-04-15 05:42:40,208 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:43,760 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-15 05:42:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 05:42:43,760 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:42:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2022-04-15 05:42:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2022-04-15 05:42:43,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 69 transitions. [2022-04-15 05:42:43,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:43,825 INFO L225 Difference]: With dead ends: 72 [2022-04-15 05:42:43,825 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 05:42:43,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=755, Invalid=5100, Unknown=1, NotChecked=150, Total=6006 [2022-04-15 05:42:43,827 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:43,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 05:42:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 05:42:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-04-15 05:42:44,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:44,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:42:44,001 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:42:44,001 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:42:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:44,002 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-15 05:42:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-04-15 05:42:44,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:44,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:44,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 70 states. [2022-04-15 05:42:44,007 INFO L87 Difference]: Start difference. First operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 70 states. [2022-04-15 05:42:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:44,009 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-15 05:42:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-04-15 05:42:44,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:44,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:44,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:44,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:42:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-15 05:42:44,020 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2022-04-15 05:42:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:44,020 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-15 05:42:44,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:44,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-15 05:42:44,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 05:42:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 05:42:44,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:44,134 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:44,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:44,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 05:42:44,358 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 3 times [2022-04-15 05:42:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:44,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820788741] [2022-04-15 05:42:44,366 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:44,366 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:44,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 4 times [2022-04-15 05:42:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:44,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171720178] [2022-04-15 05:42:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {5290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5274#true} is VALID [2022-04-15 05:42:44,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:42:44,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5274#true} {5274#true} #67#return; {5274#true} is VALID [2022-04-15 05:42:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 05:42:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {5274#true} ~cond := #in~cond; {5274#true} is VALID [2022-04-15 05:42:44,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {5274#true} assume !(0 == ~cond); {5274#true} is VALID [2022-04-15 05:42:44,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:42:44,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5274#true} {5275#false} #65#return; {5275#false} is VALID [2022-04-15 05:42:44,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {5274#true} call ULTIMATE.init(); {5290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:44,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {5290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5274#true} is VALID [2022-04-15 05:42:44,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:42:44,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5274#true} {5274#true} #67#return; {5274#true} is VALID [2022-04-15 05:42:44,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {5274#true} call #t~ret13 := main(); {5274#true} is VALID [2022-04-15 05:42:44,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5))} is VALID [2022-04-15 05:42:44,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {5279#(and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= 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); {5280#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:44,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {5280#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5280#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:42:44,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {5280#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (or (<= main_~max~0 5) (and (<= main_~max~0 4294967301) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5281#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:44,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {5281#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5281#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:44,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5281#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967299) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5282#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} is VALID [2022-04-15 05:42:44,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {5282#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5282#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} is VALID [2022-04-15 05:42:44,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {5282#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5283#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} is VALID [2022-04-15 05:42:44,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {5283#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5283#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} is VALID [2022-04-15 05:42:44,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {5283#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967297))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5284#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:44,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {5284#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5284#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:44,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {5284#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967296) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5285#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967295) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {5285#(and (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967295) (< 0 (div (+ main_~max~0 4294967295) 4294967296)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {5275#false} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {5275#false} assume !(~i~0 >= 0); {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {5275#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; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {5275#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L272 TraceCheckUtils]: 33: Hoare triple {5275#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5274#true} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {5274#true} ~cond := #in~cond; {5274#true} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {5274#true} assume !(0 == ~cond); {5274#true} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:42:44,598 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5274#true} {5275#false} #65#return; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {5275#false} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {5275#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {5275#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L272 TraceCheckUtils]: 41: Hoare triple {5275#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5275#false} is VALID [2022-04-15 05:42:44,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {5275#false} ~cond := #in~cond; {5275#false} is VALID [2022-04-15 05:42:44,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {5275#false} assume 0 == ~cond; {5275#false} is VALID [2022-04-15 05:42:44,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {5275#false} assume !false; {5275#false} is VALID [2022-04-15 05:42:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 05:42:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:44,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171720178] [2022-04-15 05:42:44,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171720178] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:44,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567483173] [2022-04-15 05:42:44,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:44,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:44,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:44,616 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:44,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 05:42:44,702 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:44,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:44,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 05:42:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:44,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:44,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:42:45,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-04-15 05:42:45,366 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 05:42:45,367 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-15 05:42:49,784 WARN L855 $PredicateComparison]: unable to prove that (exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296))) (let ((.cse0 (+ .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))) (and (<= .cse0 (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= .cse0 (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4))) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4))) (<= .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 .cse1 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)))))) is different from true [2022-04-15 05:42:56,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:56,644 INFO L356 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-04-15 05:42:56,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 13 [2022-04-15 05:42:56,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {5274#true} call ULTIMATE.init(); {5274#true} is VALID [2022-04-15 05:42:56,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {5274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5274#true} is VALID [2022-04-15 05:42:56,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:42:56,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5274#true} {5274#true} #67#return; {5274#true} is VALID [2022-04-15 05:42:56,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {5274#true} call #t~ret13 := main(); {5274#true} is VALID [2022-04-15 05:42:56,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5309#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {5309#(and (= |main_~#str1~0.offset| 0) (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); {5346#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:56,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {5346#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5350#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:56,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {5350#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) main_~i~0)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= main_~i~0 (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5354#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5358#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {5358#(and (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 1)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) (+ main_~i~0 1)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5362#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {5362#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (= main_~j~0 2) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5366#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 2))} is VALID [2022-04-15 05:42:56,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {5366#(and (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 2) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~j~0) 2))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5370#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ (- 1) main_~j~0) 2))} is VALID [2022-04-15 05:42:56,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {5370#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (= (+ (- 1) main_~j~0) 2))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5374#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} is VALID [2022-04-15 05:42:56,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {5374#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 3) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5378#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {5378#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 4) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5382#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {5382#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (or (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ main_~i~0 4) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5386#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ 5 main_~i~0) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#(and (= 5 main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (or (and (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (+ 5 main_~i~0) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4294967296)))) (and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5390#(and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {5390#(and (= (+ 5 main_~i~0) (mod (+ main_~max~0 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= |main_~#str1~0.offset| 0) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5394#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} is VALID [2022-04-15 05:42:56,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {5394#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 6)))} assume !(~i~0 >= 0); {5398#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 6) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:42:56,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {5398#(and (< (mod (+ main_~max~0 4294967295) 4294967296) 6) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) (- 4) |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= |main_~#str1~0.offset| 0) (<= 5 (mod (+ main_~max~0 4294967295) 4294967296)) (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; {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 05:42:56,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 05:42:57,417 INFO L272 TraceCheckUtils]: 33: Hoare triple {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 05:42:57,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} ~cond := #in~cond; {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 05:42:57,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} assume !(0 == ~cond); {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 05:42:57,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} assume true; {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} is VALID [2022-04-15 05:42:57,435 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5409#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 Int) (aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 Int) (aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_3| Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (aux_div_v_main_~j~0_BEFORE_CALL_3_56 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (+ (* 4294967296 aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119) 5)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (* aux_div_v_main_~j~0_BEFORE_CALL_3_56 4294967296)) (< 0 (+ 4294967291 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172)) (< aux_div_v_main_~j~0_BEFORE_CALL_3_56 (+ aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 1)) (= (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) 4294967296) (- 4)))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|)) (< aux_div_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119 (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 1)) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172) (<= (* aux_div_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154 4294967296) (+ 4294967290 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~j~0_BEFORE_CALL_3_56_119_154_172))))} {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} #65#return; {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} is VALID [2022-04-15 05:42:57,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {5402#(and (< (div (+ main_~j~0 (- 5)) (- 4294967296)) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) 1)) (= |main_~#str1~0.offset| 0) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod main_~j~0 4294967296) (- 4) |main_~#str1~0.offset|))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div main_~j~0 (- 4294967296)) (+ (div (+ 5 (* (- 1) main_~j~0)) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5425#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:42:57,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {5425#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5429#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {5429#(and (= (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4)) (select (select |#memory_int| |main_~#str1~0.base|) (+ (mod (+ main_~j~0 1) 4294967296) (- 4) |main_~#str1~0.offset|))) (<= 0 (+ main_~j~0 1)) (= |main_~#str1~0.offset| 0) (< main_~j~0 4294967295) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< (div (+ main_~j~0 (- 4)) (- 4294967296)) (+ (div (+ 4294967294 (* (- 1) main_~j~0)) 4294967296) 1)) (< (div (+ main_~j~0 1) (- 4294967296)) (+ (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5433#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:42:57,440 INFO L272 TraceCheckUtils]: 41: Hoare triple {5433#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {5441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5275#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {5275#false} assume !false; {5275#false} is VALID [2022-04-15 05:42:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 2 not checked. [2022-04-15 05:42:57,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:58,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:58,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 05:42:58,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-04-15 05:42:58,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 400 [2022-04-15 05:42:59,025 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-04-15 05:42:59,026 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 199 [2022-04-15 05:42:59,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 05:42:59,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 218 [2022-04-15 05:42:59,215 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-15 05:42:59,216 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 96 [2022-04-15 05:42:59,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-04-15 05:42:59,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 05:42:59,390 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-04-15 05:42:59,391 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 201 [2022-04-15 05:42:59,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:59,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 206 [2022-04-15 05:43:00,274 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-04-15 05:43:00,274 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-04-15 05:43:00,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2022-04-15 05:43:00,337 INFO L356 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2022-04-15 05:43:00,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 373 treesize of output 326 [2022-04-15 05:43:01,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {5275#false} assume !false; {5275#false} is VALID [2022-04-15 05:43:01,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {5441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5275#false} is VALID [2022-04-15 05:43:01,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:01,610 INFO L272 TraceCheckUtils]: 41: Hoare triple {5433#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:01,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {5460#(= (select (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|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5433#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:43:01,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {5464#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5460#(= (select (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|)))} is VALID [2022-04-15 05:43:01,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {5464#(= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)))} is VALID [2022-04-15 05:43:01,613 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5274#true} {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} #65#return; {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:43:01,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:43:01,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {5274#true} assume !(0 == ~cond); {5274#true} is VALID [2022-04-15 05:43:01,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {5274#true} ~cond := #in~cond; {5274#true} is VALID [2022-04-15 05:43:01,613 INFO L272 TraceCheckUtils]: 33: Hoare triple {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5274#true} is VALID [2022-04-15 05:43:01,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:43:01,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {5490#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} ~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; {5468#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)))} is VALID [2022-04-15 05:43:01,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {5494#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} assume !(~i~0 >= 0); {5490#(and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))))} is VALID [2022-04-15 05:43:01,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {5498#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5494#(or (<= 0 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 05:43:01,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {5502#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5498#(or (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))) (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1))))))} is VALID [2022-04-15 05:43:01,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {5506#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))))) (not (<= 1 main_~i~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5502#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))))))} is VALID [2022-04-15 05:43:01,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {5510#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5506#(or (<= 2 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (- 1) (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset|))))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (forall ((v_ArrVal_513 Int)) (= (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513)) |main_~#str1~0.base|) (+ |main_~#str1~0.offset| 1)) (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) v_ArrVal_513) (+ (mod (+ main_~max~0 4294967295) 4294967296) |main_~#str2~0.offset| (- 4294967297))))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:43:01,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {5514#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5510#(or (<= 2 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 1 main_~i~0)))} is VALID [2022-04-15 05:43:01,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {5518#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5514#(or (not (<= 2 main_~i~0)) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:43:01,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {5522#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5518#(or (not (<= 2 main_~i~0)) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (<= 3 main_~i~0))} is VALID [2022-04-15 05:43:01,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {5526#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5522#(or (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967298)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) (not (<= 3 main_~i~0)) (<= 4 main_~i~0))} is VALID [2022-04-15 05:43:01,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {5530#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5526#(or (not (<= 3 main_~i~0)) (<= 4 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 05:43:01,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {5534#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5530#(or (not (<= 4 main_~i~0)) (<= 5 main_~i~0) (and (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 3)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4294967299)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))))} is VALID [2022-04-15 05:43:01,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {5538#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 5 main_~i~0)) (<= 6 main_~i~0))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {5534#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 4 main_~i~0)) (<= 5 main_~i~0))} is VALID [2022-04-15 05:43:01,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {5542#(or (not (<= 5 main_~i~0)) (<= 6 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~j~0))))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5538#(or (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~j~0 4))))) (not (<= 5 main_~i~0)) (<= 6 main_~i~0))} is VALID [2022-04-15 05:43:01,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {5546#(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); {5542#(or (not (<= 5 main_~i~0)) (<= 6 main_~i~0) (and (or (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (and (= (+ main_~j~0 4294967301) (mod (+ main_~max~0 4294967295) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (not (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ 5 main_~j~0))))))} is VALID [2022-04-15 05:43:01,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {5546#(not (= |main_~#str1~0.base| |main_~#str2~0.base|))} is VALID [2022-04-15 05:43:01,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {5274#true} call #t~ret13 := main(); {5274#true} is VALID [2022-04-15 05:43:01,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5274#true} {5274#true} #67#return; {5274#true} is VALID [2022-04-15 05:43:01,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {5274#true} assume true; {5274#true} is VALID [2022-04-15 05:43:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {5274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5274#true} is VALID [2022-04-15 05:43:01,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {5274#true} call ULTIMATE.init(); {5274#true} is VALID [2022-04-15 05:43:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:43:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567483173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:01,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:01,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24, 23] total 50 [2022-04-15 05:43:01,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820788741] [2022-04-15 05:43:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820788741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:01,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:01,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:43:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783802590] [2022-04-15 05:43:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 05:43:01,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:01,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:01,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:01,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:43:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:43:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2073, Unknown=1, NotChecked=94, Total=2450 [2022-04-15 05:43:01,661 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:02,599 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-04-15 05:43:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:43:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 05:43:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 05:43:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 05:43:02,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-04-15 05:43:02,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:02,666 INFO L225 Difference]: With dead ends: 83 [2022-04-15 05:43:02,666 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 05:43:02,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=384, Invalid=2699, Unknown=1, NotChecked=108, Total=3192 [2022-04-15 05:43:02,667 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 76 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:02,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:43:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 05:43:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-04-15 05:43:02,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:02,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:43:02,929 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:43:02,929 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:43:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:02,930 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 05:43:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 05:43:02,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:02,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:02,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 64 states. [2022-04-15 05:43:02,931 INFO L87 Difference]: Start difference. First operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 64 states. [2022-04-15 05:43:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:02,931 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-15 05:43:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 05:43:02,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:02,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:02,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:02,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:43:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-04-15 05:43:02,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2022-04-15 05:43:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:02,933 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-04-15 05:43:02,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:43:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 55 transitions. [2022-04-15 05:43:03,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 05:43:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 05:43:03,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:03,042 INFO L499 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] [2022-04-15 05:43:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 05:43:03,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 05:43:03,243 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 5 times [2022-04-15 05:43:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:03,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734932979] [2022-04-15 05:43:03,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:03,248 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:03,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 6 times [2022-04-15 05:43:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:03,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002705821] [2022-04-15 05:43:03,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:04,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {6050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6016#true} is VALID [2022-04-15 05:43:04,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6016#true} {6016#true} #67#return; {6016#true} is VALID [2022-04-15 05:43:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-15 05:43:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:04,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {6016#true} ~cond := #in~cond; {6016#true} is VALID [2022-04-15 05:43:04,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#true} assume !(0 == ~cond); {6016#true} is VALID [2022-04-15 05:43:04,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6016#true} {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 05:43:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:04,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {6016#true} ~cond := #in~cond; {6016#true} is VALID [2022-04-15 05:43:04,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#true} assume !(0 == ~cond); {6016#true} is VALID [2022-04-15 05:43:04,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6016#true} {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:04,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {6016#true} call ULTIMATE.init(); {6050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:04,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {6050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6016#true} is VALID [2022-04-15 05:43:04,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6016#true} {6016#true} #67#return; {6016#true} is VALID [2022-04-15 05:43:04,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {6016#true} call #t~ret13 := main(); {6016#true} is VALID [2022-04-15 05:43:04,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {6016#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {6022#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:43:04,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {6022#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6023#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:43:04,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {6023#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6024#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:43:04,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {6024#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6025#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:43:04,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {6025#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6026#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 05:43:04,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {6026#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6027#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 05:43:04,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {6027#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 2)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6028#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} is VALID [2022-04-15 05:43:04,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {6028#(and (= |main_~#str2~0.offset| 0) (<= 3 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6029#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} is VALID [2022-04-15 05:43:04,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {6029#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (or (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 2 (+ main_~i~0 |main_~#str1~0.offset|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6030#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)))} is VALID [2022-04-15 05:43:04,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {6030#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ main_~i~0 |main_~#str1~0.offset| 1) 0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= (+ main_~j~0 |main_~#str2~0.offset|) 2)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6031#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {6031#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (or (<= 1 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6032#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} is VALID [2022-04-15 05:43:04,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {6032#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= 0 (+ main_~i~0 |main_~#str1~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2))) (<= (+ 4294967290 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))} assume !(~i~0 >= 0); {6033#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {6033#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (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; {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,603 INFO L272 TraceCheckUtils]: 31: Hoare triple {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6016#true} is VALID [2022-04-15 05:43:04,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {6016#true} ~cond := #in~cond; {6016#true} is VALID [2022-04-15 05:43:04,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {6016#true} assume !(0 == ~cond); {6016#true} is VALID [2022-04-15 05:43:04,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,604 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6016#true} {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #65#return; {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:04,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {6034#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ main_~max~0 4294967295) (+ main_~j~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6039#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:04,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {6039#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:04,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:04,606 INFO L272 TraceCheckUtils]: 39: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6016#true} is VALID [2022-04-15 05:43:04,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {6016#true} ~cond := #in~cond; {6016#true} is VALID [2022-04-15 05:43:04,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {6016#true} assume !(0 == ~cond); {6016#true} is VALID [2022-04-15 05:43:04,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:04,606 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6016#true} {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:04,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6045#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) 2) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 05:43:04,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {6045#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) 2) (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6046#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 2) (< 1 (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-15 05:43:04,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {6046#(and (= |main_~#str2~0.offset| 0) (= (select (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| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 |main_~#str1~0.offset|) 2) (< 1 (+ main_~i~0 |main_~#str1~0.offset|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6047#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:43:04,609 INFO L272 TraceCheckUtils]: 47: Hoare triple {6047#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6048#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:43:04,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {6048#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6049#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:43:04,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {6049#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6017#false} is VALID [2022-04-15 05:43:04,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {6017#false} assume !false; {6017#false} is VALID [2022-04-15 05:43:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 05:43:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002705821] [2022-04-15 05:43:04,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002705821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234291748] [2022-04-15 05:43:04,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:43:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:04,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:43:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 05:43:04,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 05:43:04,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:04,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 05:43:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:04,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:04,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-04-15 05:43:05,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-04-15 05:43:05,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:43:05,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-04-15 05:43:06,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:43:06,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-04-15 05:43:09,864 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2)) (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)))) is different from true [2022-04-15 05:43:10,861 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2)))) is different from true [2022-04-15 05:43:11,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:43:11,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:43:11,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-15 05:43:11,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {6016#true} call ULTIMATE.init(); {6016#true} is VALID [2022-04-15 05:43:11,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6016#true} is VALID [2022-04-15 05:43:11,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {6016#true} assume true; {6016#true} is VALID [2022-04-15 05:43:11,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6016#true} {6016#true} #67#return; {6016#true} is VALID [2022-04-15 05:43:11,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {6016#true} call #t~ret13 := main(); {6016#true} is VALID [2022-04-15 05:43:11,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {6016#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack((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.allocOnStack((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; {6069#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {6069#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6069#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {6069#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6076#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {6076#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6076#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {6076#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet5; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {6021#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (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); {6022#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:43:11,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {6022#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6023#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} is VALID [2022-04-15 05:43:11,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {6023#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (= (+ (- 1) (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0) 0)) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (= (+ (* (- 1) main_~i~0) (* (div (+ main_~max~0 4294967295) 4294967296) (- 4294967296)) main_~max~0 4294967295) 0))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6024#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:43:11,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {6024#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6025#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} is VALID [2022-04-15 05:43:11,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {6025#(and (= |main_~#str2~0.offset| 0) (or (<= (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967294)))) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (<= main_~max~0 (+ main_~i~0 2 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967294) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6026#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} is VALID [2022-04-15 05:43:11,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {6026#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6122#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {6122#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ main_~max~0 4294967293) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ main_~max~0 4294967293))) (<= (+ main_~i~0 3 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0)) (<= main_~j~0 3))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6126#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {6126#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1))) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))) (<= main_~j~0 3))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6130#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_main_~j~0_91 Int)) (and (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3) (<= (+ v_main_~j~0_91 1) main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))))) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} is VALID [2022-04-15 05:43:11,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (or (and (<= main_~max~0 (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (<= (+ 4294967292 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_main_~j~0_91 Int)) (and (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3) (<= (+ v_main_~j~0_91 1) main_~j~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset| 1)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))))) (or (<= (+ main_~i~0 4 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967292 main_~max~0)))))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6134#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_main_~j~0_91 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3) (<= (+ v_main_~j~0_91 1) main_~j~0))))} is VALID [2022-04-15 05:43:11,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {6134#(and (= |main_~#str2~0.offset| 0) (or (<= (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) main_~max~0) (and (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (or (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (and (<= main_~max~0 (+ 5 main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (not (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_main_~j~0_91 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3) (<= (+ v_main_~j~0_91 1) main_~j~0))))} assume !!(~i~0 >= 0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call write~int(#t~mem7, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem7;#t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6138#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (exists ((v_main_~j~0_91 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} is VALID [2022-04-15 05:43:11,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {6138#(and (= |main_~#str2~0.offset| 0) (<= (+ 4294967291 main_~max~0) (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (exists ((v_main_~j~0_91 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 2 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= 3 v_main_~j~0_91) (<= v_main_~j~0_91 3))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))} #t~post6 := ~i~0;~i~0 := #t~post6 - 1;havoc #t~post6; {6142#(and (= |main_~#str2~0.offset| 0) (exists ((v_main_~i~0_157 Int) (v_main_~j~0_91 Int)) (and (<= 0 v_main_~i~0_157) (<= v_main_~i~0_157 (+ main_~i~0 1)) (<= 3 v_main_~j~0_91) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset| v_main_~i~0_157)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= v_main_~j~0_91 3) (<= (+ 4294967291 main_~max~0) (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {6142#(and (= |main_~#str2~0.offset| 0) (exists ((v_main_~i~0_157 Int) (v_main_~j~0_91 Int)) (and (<= 0 v_main_~i~0_157) (<= v_main_~i~0_157 (+ main_~i~0 1)) (<= 3 v_main_~j~0_91) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ 2 |main_~#str1~0.offset| v_main_~i~0_157)) (select (select |#memory_int| |main_~#str2~0.base|) (+ v_main_~j~0_91 (- 1) |main_~#str2~0.offset|))) (<= v_main_~j~0_91 3) (<= (+ 4294967291 main_~max~0) (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (<= (+ v_main_~i~0_157 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (+ 4294967291 main_~max~0)))) (= |main_~#str1~0.offset| 0) (<= (+ main_~max~0 2147483648) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 >= 0); {6033#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-15 05:43:11,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {6033#(and (= |main_~#str2~0.offset| 0) (<= (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296) (+ 4294967291 main_~max~0)) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= (+ 4294967291 main_~max~0) (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) (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; {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:43:11,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:43:11,615 INFO L272 TraceCheckUtils]: 31: Hoare triple {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 05:43:11,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} ~cond := #in~cond; {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 05:43:11,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} assume !(0 == ~cond); {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 05:43:11,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} assume true; {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} is VALID [2022-04-15 05:43:11,617 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6156#(exists ((|v_main_~#str2~0.base_BEFORE_CALL_5| Int) (|v_main_~#str1~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_5| |v_main_~#str1~0.base_BEFORE_CALL_5|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_5|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_5|) 2))))} {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} #65#return; {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} is VALID [2022-04-15 05:43:11,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {6149#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= 0 main_~j~0) (< main_~j~0 4294967296) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< (+ (div main_~j~0 (- 4294967296)) (div (+ main_~j~0 (- 4)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) main_~j~0)) 4294967296) (div (+ (* (- 1) main_~j~0) 4) 4294967296) 1)))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6039#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {6039#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (= main_~i~0 0) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 3))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,622 INFO L272 TraceCheckUtils]: 39: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 05:43:11,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} ~cond := #in~cond; {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 05:43:11,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} assume !(0 == ~cond); {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 05:43:11,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} assume true; {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} is VALID [2022-04-15 05:43:11,623 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6181#(exists ((|v_main_~#str1~0.base_BEFORE_CALL_6| Int) (|v_main_~#str2~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_6| |v_main_~#str1~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_6|) 2) (select (select |#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_6|) 2))))} {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} #65#return; {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} is VALID [2022-04-15 05:43:11,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {6040#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~i~0 1) (<= 3 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0) (<= main_~j~0 3))} havoc #t~mem10;havoc #t~mem11;#t~post12 := ~j~0;~j~0 := #t~post12 - 1;havoc #t~post12; {6197#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-15 05:43:11,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {6197#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= main_~i~0 1) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6201#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-15 05:43:11,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {6201#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~i~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 2) (select (select |#memory_int| |main_~#str1~0.base|) 2)) (<= main_~j~0 2) (<= 2 main_~j~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem10 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem11 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {6047#(= |main_#t~mem11| |main_#t~mem10|)} is VALID [2022-04-15 05:43:11,625 INFO L272 TraceCheckUtils]: 47: Hoare triple {6047#(= |main_#t~mem11| |main_#t~mem10|)} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:11,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {6208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:11,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {6212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6017#false} is VALID [2022-04-15 05:43:11,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {6017#false} assume !false; {6017#false} is VALID [2022-04-15 05:43:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-04-15 05:43:11,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:12,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:43:12,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 458 [2022-04-15 05:43:27,317 INFO L356 Elim1Store]: treesize reduction 25, result has 46.8 percent of original size [2022-04-15 05:43:27,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4126 treesize of output 3715