/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/heavy-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:34,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:34,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:34,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:34,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:34,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:34,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:34,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:34,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:34,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:34,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:34,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:34,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:34,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:34,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:34,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:34,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:34,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:34,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:34,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:34,723 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:34,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:34,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:34,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:34,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:34,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:34,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:34,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:34,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:34,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:34,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:34,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:34,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:34,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:34,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:34,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:34,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:34,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:34,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:34,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:34,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:34,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:34,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:34,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:34,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:34,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:34,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:34,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:34,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:34,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:34,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:34,749 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:34,749 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 12:01:34,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:35,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:35,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:35,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:35,018 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:35,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-1.c [2022-04-15 12:01:35,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dd521b8/4eaf5347ce3e463ba4670828a34ab6ea/FLAGb69e74ab3 [2022-04-15 12:01:35,468 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:35,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-1.c [2022-04-15 12:01:35,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dd521b8/4eaf5347ce3e463ba4670828a34ab6ea/FLAGb69e74ab3 [2022-04-15 12:01:35,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dd521b8/4eaf5347ce3e463ba4670828a34ab6ea [2022-04-15 12:01:35,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:35,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:35,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:35,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:35,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:35,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605319da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35, skipping insertion in model container [2022-04-15 12:01:35,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:35,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:36,009 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/heavy-1.c[600,613] [2022-04-15 12:01:36,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:36,034 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:36,045 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/heavy-1.c[600,613] [2022-04-15 12:01:36,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:36,073 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:36,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36 WrapperNode [2022-04-15 12:01:36,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:36,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:36,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:36,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:36,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:36,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:36,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:36,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:36,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (1/1) ... [2022-04-15 12:01:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:36,137 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 12:01:36,139 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 12:01:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:36,230 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:36,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:36,407 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:36,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:36,413 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:01:36,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:36 BoogieIcfgContainer [2022-04-15 12:01:36,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:36,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:36,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:36,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:36,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:35" (1/3) ... [2022-04-15 12:01:36,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31572d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:36, skipping insertion in model container [2022-04-15 12:01:36,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:36" (2/3) ... [2022-04-15 12:01:36,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31572d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:36, skipping insertion in model container [2022-04-15 12:01:36,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:36" (3/3) ... [2022-04-15 12:01:36,431 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-1.c [2022-04-15 12:01:36,435 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:36,435 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:36,463 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:36,468 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 12:01:36,469 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 12:01:36,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:36,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:36,500 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 1 times [2022-04-15 12:01:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140478352] [2022-04-15 12:01:36,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 2 times [2022-04-15 12:01:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:36,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488297659] [2022-04-15 12:01:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 12:01:36,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:01:36,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 12:01:36,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:36,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 12:01:36,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:01:36,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 12:01:36,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2022-04-15 12:01:36,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2022-04-15 12:01:36,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:01:36,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 != ~a~0 % 4294967296; {23#false} is VALID [2022-04-15 12:01:36,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:01:36,728 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 12:01:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488297659] [2022-04-15 12:01:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488297659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:36,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:36,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140478352] [2022-04-15 12:01:36,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140478352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233338242] [2022-04-15 12:01:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:36,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:36,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:36,783 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,923 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-15 12:01:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 12:01:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 12:01:36,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-15 12:01:36,989 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 12:01:37,004 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:01:37,004 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:01:37,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:37,011 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:37,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:01:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2022-04-15 12:01:37,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:37,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,037 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,038 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,043 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:01:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:01:37,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:01:37,044 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:01:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,047 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:01:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:01:37,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:37,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 12:01:37,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-15 12:01:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:37,051 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 12:01:37,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 12:01:37,067 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 12:01:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 12:01:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 12:01:37,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:37,068 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:37,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:37,069 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 1 times [2022-04-15 12:01:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400995608] [2022-04-15 12:01:37,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 2 times [2022-04-15 12:01:37,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:37,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273381797] [2022-04-15 12:01:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 12:01:37,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 12:01:37,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 12:01:37,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:37,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 12:01:37,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 12:01:37,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 12:01:37,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {190#true} is VALID [2022-04-15 12:01:37,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {195#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(= main_~i~0 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {191#false} is VALID [2022-04-15 12:01:37,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume 0 != ~a~0 % 4294967296; {191#false} is VALID [2022-04-15 12:01:37,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-15 12:01:37,170 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 12:01:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:37,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273381797] [2022-04-15 12:01:37,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273381797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:37,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:37,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:37,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400995608] [2022-04-15 12:01:37,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400995608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:37,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:37,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:37,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160104179] [2022-04-15 12:01:37,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:37,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:37,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:37,182 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,288 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 12:01:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:37,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:37,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 12:01:37,333 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 12:01:37,336 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:01:37,336 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:01:37,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 12:01:37,338 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:37,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:01:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-15 12:01:37,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:37,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,344 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,346 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,347 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:01:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:01:37,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:01:37,349 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:01:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,352 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:01:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:01:37,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:37,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 12:01:37,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-15 12:01:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:37,353 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 12:01:37,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 12:01:37,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 12:01:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:37,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:37,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:37,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:37,370 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1310776898, now seen corresponding path program 1 times [2022-04-15 12:01:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180988686] [2022-04-15 12:01:37,498 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:01:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 254700179, now seen corresponding path program 1 times [2022-04-15 12:01:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405060237] [2022-04-15 12:01:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 12:01:37,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:01:37,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 12:01:37,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:37,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 12:01:37,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:01:37,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 12:01:37,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {371#true} is VALID [2022-04-15 12:01:37,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {376#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 0)} [58] L12-3-->L12-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= |v_main_#t~post4_Out_2| 1) (= v_main_~i~0_Out_2 0) (< (mod (+ v_main_~i~0_Out_2 4294967295) 4294967296) 1048576) (= v_main_~j~0_Out_2 0) .cse0 (<= 1048576 (mod v_main_~j~0_Out_2 4294967296))) .cse0)) InVars {main_~i~0=v_main_~i~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~i~0=v_main_~i~0_Out_2, main_~j~0=v_main_~j~0_Out_2} AuxVars[] AssignedVars[main_~j~0, main_#t~post4, main_~i~0] {376#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(= main_~i~0 0)} [57] L12-4_primed-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-15 12:01:37,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#false} assume 0 != ~a~0 % 4294967296; {372#false} is VALID [2022-04-15 12:01:37,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-15 12:01:37,620 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 12:01:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405060237] [2022-04-15 12:01:37,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405060237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:37,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:37,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:37,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180988686] [2022-04-15 12:01:37,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180988686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:37,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:37,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280536527] [2022-04-15 12:01:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:37,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:37,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:37,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:37,675 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,817 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 12:01:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:37,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:01:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:01:37,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 12:01:37,874 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 12:01:37,875 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:01:37,875 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:01:37,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:37,876 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:37,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:01:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2022-04-15 12:01:37,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:37,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,880 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,880 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,881 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:01:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 12:01:37,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:37,882 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,884 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:01:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 12:01:37,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:37,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:01:37,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 12:01:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:37,889 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:01:37,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:01:37,906 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 12:01:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:01:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:01:37,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:37,907 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:37,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:01:37,908 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 1 times [2022-04-15 12:01:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604204140] [2022-04-15 12:01:38,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 12:01:38,172 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 2 times [2022-04-15 12:01:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421550853] [2022-04-15 12:01:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 12:01:38,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:01:38,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 12:01:38,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:38,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 12:01:38,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:01:38,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 12:01:38,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {593#true} is VALID [2022-04-15 12:01:38,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {593#true} is VALID [2022-04-15 12:01:38,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {593#true} is VALID [2022-04-15 12:01:38,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {593#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {598#(= main_~k~0 0)} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#(= main_~k~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {594#false} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {594#false} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:38,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#false} assume 0 != ~a~0 % 4294967296; {594#false} is VALID [2022-04-15 12:01:38,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 12:01:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:38,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421550853] [2022-04-15 12:01:38,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421550853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:38,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:38,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:38,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:38,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604204140] [2022-04-15 12:01:38,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604204140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:38,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:38,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047214058] [2022-04-15 12:01:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:38,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:38,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,231 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 12:01:38,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:38,233 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,323 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 12:01:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:38,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:01:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:01:38,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-15 12:01:38,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,347 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:01:38,347 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:01:38,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 12:01:38,350 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:38,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:01:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-15 12:01:38,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:38,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,356 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,357 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,357 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:01:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:38,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:01:38,361 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:01:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,364 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:01:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:38,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:38,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:01:38,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-15 12:01:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:38,367 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:01:38,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:01:38,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:01:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:01:38,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:38,380 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 12:01:38,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:01:38,380 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 1 times [2022-04-15 12:01:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020318151] [2022-04-15 12:01:38,446 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:38,446 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:38,457 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:38,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 2 times [2022-04-15 12:01:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:38,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782903787] [2022-04-15 12:01:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:38,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:38,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:38,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:38,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:38,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:38,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:38,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {738#true} is VALID [2022-04-15 12:01:38,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {738#true} is VALID [2022-04-15 12:01:38,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {738#true} is VALID [2022-04-15 12:01:38,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {743#(= main_~k~0 0)} is VALID [2022-04-15 12:01:38,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {743#(= main_~k~0 0)} is VALID [2022-04-15 12:01:38,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {743#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {744#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {739#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 != ~a~0 % 4294967296; {739#false} is VALID [2022-04-15 12:01:38,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 12:01:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782903787] [2022-04-15 12:01:38,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782903787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843990795] [2022-04-15 12:01:38,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:38,592 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 12:01:38,593 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 12:01:38,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:38,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:38,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:01:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:38,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-15 12:01:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:38,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:38,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:38,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {738#true} is VALID [2022-04-15 12:01:38,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {764#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {789#(= main_~i~0 1)} is VALID [2022-04-15 12:01:38,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:38,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 != ~a~0 % 4294967296; {739#false} is VALID [2022-04-15 12:01:38,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 12:01:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:01:38,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:38,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 12:01:38,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 != ~a~0 % 4294967296; {739#false} is VALID [2022-04-15 12:01:38,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:38,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {805#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {809#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:38,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {738#true} is VALID [2022-04-15 12:01:38,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:38,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:38,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:38,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-15 12:01:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:01:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843990795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:38,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:38,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-15 12:01:38,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020318151] [2022-04-15 12:01:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020318151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:38,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:38,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774980676] [2022-04-15 12:01:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:38,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:38,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,834 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 12:01:38,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:01:38,835 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,905 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 12:01:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:01:38,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:01:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:01:38,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 12:01:38,929 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 12:01:38,930 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:01:38,930 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:01:38,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:01:38,931 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:38,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:01:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 12:01:38,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:38,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,936 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,936 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,938 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:01:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 12:01:38,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:01:38,938 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:01:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,939 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:01:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 12:01:38,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:38,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 12:01:38,940 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-15 12:01:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:38,941 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 12:01:38,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 12:01:38,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:01:38,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:38,955 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:38,975 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 12:01:39,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:39,171 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -846064617, now seen corresponding path program 3 times [2022-04-15 12:01:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990745471] [2022-04-15 12:01:39,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:39,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:39,388 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:39,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -846064617, now seen corresponding path program 4 times [2022-04-15 12:01:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:39,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568068711] [2022-04-15 12:01:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:39,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1009#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1001#true} is VALID [2022-04-15 12:01:39,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-15 12:01:39,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1001#true} {1001#true} #54#return; {1001#true} is VALID [2022-04-15 12:01:39,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1009#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:39,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1009#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1001#true} is VALID [2022-04-15 12:01:39,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-15 12:01:39,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #54#return; {1001#true} is VALID [2022-04-15 12:01:39,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1001#true} is VALID [2022-04-15 12:01:39,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1001#true} is VALID [2022-04-15 12:01:39,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1001#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1001#true} is VALID [2022-04-15 12:01:39,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1006#(= main_~k~0 0)} is VALID [2022-04-15 12:01:39,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1006#(= main_~k~0 0)} is VALID [2022-04-15 12:01:39,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1007#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:39,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {1007#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1007#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:39,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {1007#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1008#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1008#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {1002#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {1002#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {1002#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1002#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1002#false} assume 0 != ~a~0 % 4294967296; {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-15 12:01:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:39,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568068711] [2022-04-15 12:01:39,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568068711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:39,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206279458] [2022-04-15 12:01:39,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:39,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:39,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:39,487 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 12:01:39,508 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 12:01:39,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:39,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:39,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:39,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:39,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1001#true} is VALID [2022-04-15 12:01:39,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1001#true} is VALID [2022-04-15 12:01:39,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-15 12:01:39,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #54#return; {1001#true} is VALID [2022-04-15 12:01:39,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1001#true} is VALID [2022-04-15 12:01:39,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1035#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:39,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {1035#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1035#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:39,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1035#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1042#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:01:39,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {1028#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1028#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1028#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1028#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1028#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {1028#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1061#(= main_~i~0 1)} is VALID [2022-04-15 12:01:39,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1002#false} is VALID [2022-04-15 12:01:39,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {1002#false} assume 0 != ~a~0 % 4294967296; {1002#false} is VALID [2022-04-15 12:01:39,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-15 12:01:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:39,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:39,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-15 12:01:39,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {1002#false} assume 0 != ~a~0 % 4294967296; {1002#false} is VALID [2022-04-15 12:01:39,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {1077#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1002#false} is VALID [2022-04-15 12:01:39,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1077#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1097#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:39,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1101#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:39,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1101#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:39,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1081#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:39,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1001#true} is VALID [2022-04-15 12:01:39,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #54#return; {1001#true} is VALID [2022-04-15 12:01:39,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-15 12:01:39,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1001#true} is VALID [2022-04-15 12:01:39,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1001#true} is VALID [2022-04-15 12:01:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206279458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:39,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-15 12:01:39,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:39,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990745471] [2022-04-15 12:01:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990745471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:39,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:01:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735653491] [2022-04-15 12:01:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:39,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:39,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,781 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 12:01:39,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:01:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:01:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:01:39,782 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,928 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 12:01:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:01:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:01:39,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 12:01:39,957 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 12:01:39,957 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:01:39,957 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:01:39,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:01:39,958 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:39,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:01:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-15 12:01:39,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:39,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,964 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,964 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,965 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:39,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:01:39,965 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:01:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,966 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:01:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:39,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:39,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 12:01:39,967 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-04-15 12:01:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:39,967 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 12:01:39,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 12:01:39,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 12:01:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:01:39,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:39,986 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:40,005 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 12:01:40,195 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,SelfDestructingSolverStorable5 [2022-04-15 12:01:40,195 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -617772747, now seen corresponding path program 5 times [2022-04-15 12:01:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831569812] [2022-04-15 12:01:40,321 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:40,321 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:40,346 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:40,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash -617772747, now seen corresponding path program 6 times [2022-04-15 12:01:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:40,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944754479] [2022-04-15 12:01:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1297#true} is VALID [2022-04-15 12:01:40,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:01:40,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1297#true} {1297#true} #54#return; {1297#true} is VALID [2022-04-15 12:01:40,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1306#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:40,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1297#true} is VALID [2022-04-15 12:01:40,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:01:40,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #54#return; {1297#true} is VALID [2022-04-15 12:01:40,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1297#true} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1297#true} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1297#true} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1302#(= main_~k~0 0)} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {1302#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1302#(= main_~k~0 0)} is VALID [2022-04-15 12:01:40,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1303#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1303#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1303#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1304#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:40,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1304#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:40,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {1304#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1305#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 3))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {1298#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {1298#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {1298#false} assume 0 != ~a~0 % 4294967296; {1298#false} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:01:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:40,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:40,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944754479] [2022-04-15 12:01:40,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944754479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:40,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405129722] [2022-04-15 12:01:40,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:40,498 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 12:01:40,500 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 12:01:40,543 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:40,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:40,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:01:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:40,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 12:01:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1297#true} is VALID [2022-04-15 12:01:40,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:01:40,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #54#return; {1297#true} is VALID [2022-04-15 12:01:40,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1297#true} is VALID [2022-04-15 12:01:40,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1325#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1325#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {1325#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1325#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1325#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {1325#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1362#(= main_~i~0 1)} is VALID [2022-04-15 12:01:40,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {1362#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1298#false} is VALID [2022-04-15 12:01:40,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {1298#false} assume 0 != ~a~0 % 4294967296; {1298#false} is VALID [2022-04-15 12:01:40,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:01:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:01:40,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:40,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:01:40,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1298#false} assume 0 != ~a~0 % 4294967296; {1298#false} is VALID [2022-04-15 12:01:40,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {1378#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1298#false} is VALID [2022-04-15 12:01:40,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1378#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1382#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:40,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1297#true} is VALID [2022-04-15 12:01:40,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #54#return; {1297#true} is VALID [2022-04-15 12:01:40,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:01:40,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1297#true} is VALID [2022-04-15 12:01:40,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 12:01:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:01:40,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405129722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:40,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:40,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2022-04-15 12:01:40,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:40,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831569812] [2022-04-15 12:01:40,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831569812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:40,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:40,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:01:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263023027] [2022-04-15 12:01:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:40,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:40,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:40,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,706 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 12:01:40,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:01:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:01:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:01:40,707 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,836 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 12:01:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:01:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:01:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:01:40,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-15 12:01:40,874 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 12:01:40,875 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:01:40,875 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:01:40,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:01:40,876 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:40,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:01:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-15 12:01:40,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:40,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,887 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,887 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,888 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:40,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:40,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:40,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:01:40,888 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:01:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,889 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:40,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:40,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:40,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:40,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:01:40,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2022-04-15 12:01:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:40,890 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:01:40,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:01:40,910 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 12:01:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:01:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:01:40,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:40,911 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:40,940 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 12:01:41,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:41,127 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -272617773, now seen corresponding path program 7 times [2022-04-15 12:01:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479221401] [2022-04-15 12:01:41,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:41,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:41,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:41,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash -272617773, now seen corresponding path program 8 times [2022-04-15 12:01:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:41,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074176940] [2022-04-15 12:01:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {1628#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1618#true} is VALID [2022-04-15 12:01:41,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:01:41,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1618#true} {1618#true} #54#return; {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1628#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1628#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #54#return; {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1618#true} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1618#true} is VALID [2022-04-15 12:01:41,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1623#(= main_~k~0 0)} is VALID [2022-04-15 12:01:41,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1623#(= main_~k~0 0)} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1624#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:41,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1624#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1624#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:41,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1625#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:41,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1625#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:41,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1626#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:41,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1626#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:41,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {1626#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1627#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {1627#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 4))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {1619#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {1619#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {1619#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1619#false} assume 0 != ~a~0 % 4294967296; {1619#false} is VALID [2022-04-15 12:01:41,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:01:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:41,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074176940] [2022-04-15 12:01:41,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074176940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:41,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784386901] [2022-04-15 12:01:41,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:41,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:41,407 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 12:01:41,408 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 12:01:41,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:41,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:41,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:41,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 12:01:41,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1618#true} is VALID [2022-04-15 12:01:41,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:01:41,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #54#return; {1618#true} is VALID [2022-04-15 12:01:41,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1618#true} is VALID [2022-04-15 12:01:41,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1647#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1654#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:41,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1654#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:41,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1661#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:41,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1647#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1647#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {1647#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1647#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1647#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {1647#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {1647#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {1647#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1647#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {1647#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1692#(= main_~i~0 1)} is VALID [2022-04-15 12:01:41,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {1692#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1619#false} is VALID [2022-04-15 12:01:41,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1619#false} assume 0 != ~a~0 % 4294967296; {1619#false} is VALID [2022-04-15 12:01:41,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:01:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:01:41,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:41,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:01:41,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1619#false} assume 0 != ~a~0 % 4294967296; {1619#false} is VALID [2022-04-15 12:01:41,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {1708#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1619#false} is VALID [2022-04-15 12:01:41,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1708#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {1740#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1744#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1740#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:41,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1744#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1744#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:41,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1744#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:41,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1712#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:41,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1618#true} is VALID [2022-04-15 12:01:41,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #54#return; {1618#true} is VALID [2022-04-15 12:01:41,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:01:41,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1618#true} is VALID [2022-04-15 12:01:41,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 12:01:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:01:41,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784386901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:41,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:41,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-04-15 12:01:41,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:41,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479221401] [2022-04-15 12:01:41,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479221401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:41,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:41,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794649377] [2022-04-15 12:01:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:41,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:41,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,707 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 12:01:41,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:01:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:01:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:01:41,708 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:41,915 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 12:01:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:01:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-15 12:01:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-15 12:01:41,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-15 12:01:41,947 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 12:01:41,948 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:01:41,948 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:01:41,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:41,948 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:41,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:01:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-15 12:01:41,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:41,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,959 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,959 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:41,960 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:01:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:01:41,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:41,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:41,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:01:41,961 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:01:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:41,961 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:01:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:01:41,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:41,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:41,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:41,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:01:41,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-15 12:01:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:41,962 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:01:41,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:01:41,984 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 12:01:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:41,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:41,984 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:42,008 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 12:01:42,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,191 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 708830449, now seen corresponding path program 9 times [2022-04-15 12:01:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197288062] [2022-04-15 12:01:42,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:42,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:42,394 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:42,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 708830449, now seen corresponding path program 10 times [2022-04-15 12:01:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:42,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526824200] [2022-04-15 12:01:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {1983#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1972#true} is VALID [2022-04-15 12:01:42,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1972#true} assume true; {1972#true} is VALID [2022-04-15 12:01:42,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1972#true} {1972#true} #54#return; {1972#true} is VALID [2022-04-15 12:01:42,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1972#true} call ULTIMATE.init(); {1983#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1983#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1972#true} is VALID [2022-04-15 12:01:42,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2022-04-15 12:01:42,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1972#true} #54#return; {1972#true} is VALID [2022-04-15 12:01:42,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1972#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1972#true} is VALID [2022-04-15 12:01:42,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1972#true} is VALID [2022-04-15 12:01:42,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {1972#true} is VALID [2022-04-15 12:01:42,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {1977#(= main_~k~0 0)} is VALID [2022-04-15 12:01:42,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1977#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1977#(= main_~k~0 0)} is VALID [2022-04-15 12:01:42,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1977#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1978#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:42,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1978#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:42,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1979#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:42,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1979#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1979#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:42,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {1979#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1980#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:42,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {1980#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1980#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:42,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1980#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1981#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:42,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {1981#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {1981#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1981#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1982#(and (<= main_~k~0 5) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1982#(and (<= main_~k~0 5) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {1973#false} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1973#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1973#false} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1973#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {1973#false} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {1973#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1973#false} is VALID [2022-04-15 12:01:42,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1973#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1973#false} is VALID [2022-04-15 12:01:42,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {1973#false} assume 0 != ~a~0 % 4294967296; {1973#false} is VALID [2022-04-15 12:01:42,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {1973#false} assume !false; {1973#false} is VALID [2022-04-15 12:01:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526824200] [2022-04-15 12:01:42,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526824200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494966217] [2022-04-15 12:01:42,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:42,521 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 12:01:42,522 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 12:01:42,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:42,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:42,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:42,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {1972#true} call ULTIMATE.init(); {1972#true} is VALID [2022-04-15 12:01:42,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {1972#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1972#true} is VALID [2022-04-15 12:01:42,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2022-04-15 12:01:42,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1972#true} #54#return; {1972#true} is VALID [2022-04-15 12:01:42,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1972#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1972#true} is VALID [2022-04-15 12:01:42,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {2002#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {2002#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2009#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:42,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {2009#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2009#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:42,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {2009#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2016#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:01:42,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2002#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {2002#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2002#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2002#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {2002#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {2002#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {2002#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {2002#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {2002#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2002#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {2002#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2053#(= main_~i~0 1)} is VALID [2022-04-15 12:01:42,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {2053#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1973#false} is VALID [2022-04-15 12:01:42,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {1973#false} assume 0 != ~a~0 % 4294967296; {1973#false} is VALID [2022-04-15 12:01:42,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1973#false} assume !false; {1973#false} is VALID [2022-04-15 12:01:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 12:01:42,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:42,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {1973#false} assume !false; {1973#false} is VALID [2022-04-15 12:01:42,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {1973#false} assume 0 != ~a~0 % 4294967296; {1973#false} is VALID [2022-04-15 12:01:42,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {2069#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {1973#false} is VALID [2022-04-15 12:01:42,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2069#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {2107#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2107#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:42,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {2111#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2111#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:42,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2111#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:42,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2073#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:42,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {1972#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1972#true} is VALID [2022-04-15 12:01:42,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1972#true} #54#return; {1972#true} is VALID [2022-04-15 12:01:42,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2022-04-15 12:01:42,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {1972#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1972#true} is VALID [2022-04-15 12:01:42,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {1972#true} call ULTIMATE.init(); {1972#true} is VALID [2022-04-15 12:01:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 12:01:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494966217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:42,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:42,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2022-04-15 12:01:42,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:42,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197288062] [2022-04-15 12:01:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197288062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:01:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805474685] [2022-04-15 12:01:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:42,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:42,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:42,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,926 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 12:01:42,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:01:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:01:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:42,927 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,179 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 12:01:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:01:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 12:01:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 12:01:43,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-15 12:01:43,222 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 12:01:43,225 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:01:43,225 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:01:43,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:01:43,228 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:43,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:01:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-15 12:01:43,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:43,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,246 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,246 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,253 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 12:01:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:01:43,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:01:43,262 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:01:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,263 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 12:01:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:01:43,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:43,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 12:01:43,264 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2022-04-15 12:01:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:43,265 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 12:01:43,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 12:01:43,293 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 12:01:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:01:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:01:43,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:43,293 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:43,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:43,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:43,513 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1012233329, now seen corresponding path program 11 times [2022-04-15 12:01:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622528786] [2022-04-15 12:01:43,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,699 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1012233329, now seen corresponding path program 12 times [2022-04-15 12:01:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996346133] [2022-04-15 12:01:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {2367#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2355#true} is VALID [2022-04-15 12:01:43,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2355#true} assume true; {2355#true} is VALID [2022-04-15 12:01:43,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2355#true} {2355#true} #54#return; {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2355#true} call ULTIMATE.init(); {2367#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:43,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2367#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2355#true} assume true; {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2355#true} {2355#true} #54#return; {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {2355#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2355#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2355#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2355#true} is VALID [2022-04-15 12:01:43,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {2355#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2360#(= main_~k~0 0)} is VALID [2022-04-15 12:01:43,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2360#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2360#(= main_~k~0 0)} is VALID [2022-04-15 12:01:43,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2360#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2361#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:43,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2361#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:43,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2361#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2362#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:43,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {2362#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2362#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:43,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {2362#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2363#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:43,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2363#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2363#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:43,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {2363#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2364#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:43,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {2364#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2364#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:43,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {2364#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2365#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:43,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2365#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:43,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2366#(and (<= main_~k~0 6) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {2366#(and (<= main_~k~0 6) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {2356#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {2356#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {2356#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {2356#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {2356#false} assume 0 != ~a~0 % 4294967296; {2356#false} is VALID [2022-04-15 12:01:43,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {2356#false} assume !false; {2356#false} is VALID [2022-04-15 12:01:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:43,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996346133] [2022-04-15 12:01:43,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996346133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:43,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906074133] [2022-04-15 12:01:43,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:43,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:43,815 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 12:01:43,825 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 12:01:43,871 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:43,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:43,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:01:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:43,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {2355#true} call ULTIMATE.init(); {2355#true} is VALID [2022-04-15 12:01:43,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {2355#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2355#true} is VALID [2022-04-15 12:01:43,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {2355#true} assume true; {2355#true} is VALID [2022-04-15 12:01:43,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2355#true} {2355#true} #54#return; {2355#true} is VALID [2022-04-15 12:01:43,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {2355#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2355#true} is VALID [2022-04-15 12:01:43,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {2355#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {2386#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {2386#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {2386#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {2386#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {2386#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {2386#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {2386#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2386#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {2386#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2441#(= main_~i~0 1)} is VALID [2022-04-15 12:01:43,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {2441#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2356#false} is VALID [2022-04-15 12:01:43,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {2356#false} assume 0 != ~a~0 % 4294967296; {2356#false} is VALID [2022-04-15 12:01:43,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {2356#false} assume !false; {2356#false} is VALID [2022-04-15 12:01:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 12:01:43,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:44,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {2356#false} assume !false; {2356#false} is VALID [2022-04-15 12:01:44,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {2356#false} assume 0 != ~a~0 % 4294967296; {2356#false} is VALID [2022-04-15 12:01:44,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {2457#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2356#false} is VALID [2022-04-15 12:01:44,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2457#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {2355#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2461#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:44,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {2355#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2355#true} is VALID [2022-04-15 12:01:44,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2355#true} {2355#true} #54#return; {2355#true} is VALID [2022-04-15 12:01:44,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2355#true} assume true; {2355#true} is VALID [2022-04-15 12:01:44,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2355#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2355#true} is VALID [2022-04-15 12:01:44,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2355#true} call ULTIMATE.init(); {2355#true} is VALID [2022-04-15 12:01:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 12:01:44,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906074133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:44,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:44,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2022-04-15 12:01:44,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622528786] [2022-04-15 12:01:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622528786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:44,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:44,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:01:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313695646] [2022-04-15 12:01:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:44,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:44,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:44,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:01:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:01:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:01:44,117 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,402 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 12:01:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:01:44,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-15 12:01:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-15 12:01:44,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-15 12:01:44,441 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 12:01:44,442 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:01:44,443 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:01:44,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:01:44,443 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:44,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:01:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-15 12:01:44,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:44,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,461 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,462 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,463 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 12:01:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:01:44,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:01:44,463 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:01:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,464 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 12:01:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:01:44,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:44,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 12:01:44,465 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2022-04-15 12:01:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:44,465 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 12:01:44,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 12:01:44,491 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 12:01:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:01:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:01:44,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:44,492 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:44,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:01:44,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:44,704 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1392115027, now seen corresponding path program 13 times [2022-04-15 12:01:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428625968] [2022-04-15 12:01:44,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:44,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:44,944 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:44,944 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1392115027, now seen corresponding path program 14 times [2022-04-15 12:01:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:44,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088304369] [2022-04-15 12:01:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:45,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2763#true} is VALID [2022-04-15 12:01:45,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 12:01:45,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #54#return; {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {2763#true} call ULTIMATE.init(); {2776#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:45,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2776#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #54#return; {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {2763#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2763#true} is VALID [2022-04-15 12:01:45,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {2763#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2768#(= main_~k~0 0)} is VALID [2022-04-15 12:01:45,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {2768#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2768#(= main_~k~0 0)} is VALID [2022-04-15 12:01:45,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2769#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:45,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2769#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:45,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {2769#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2770#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:45,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {2770#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2770#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:45,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2771#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:45,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {2771#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2771#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:45,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {2771#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2772#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:45,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {2772#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2772#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:45,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {2772#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2773#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:45,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {2773#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2773#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:45,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {2773#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2774#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:45,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {2774#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2774#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:45,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {2774#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2775#(and (<= main_~k~0 7) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {2775#(and (<= main_~k~0 7) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {2764#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {2764#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {2764#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {2764#false} assume 0 != ~a~0 % 4294967296; {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-15 12:01:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:45,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088304369] [2022-04-15 12:01:45,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088304369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:45,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315248854] [2022-04-15 12:01:45,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:45,096 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 12:01:45,097 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 12:01:45,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:45,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:45,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:45,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:45,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {2763#true} call ULTIMATE.init(); {2763#true} is VALID [2022-04-15 12:01:45,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2763#true} is VALID [2022-04-15 12:01:45,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 12:01:45,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #54#return; {2763#true} is VALID [2022-04-15 12:01:45,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2763#true} is VALID [2022-04-15 12:01:45,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {2795#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {2795#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2802#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:45,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {2802#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2802#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:45,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {2802#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2809#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:45,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {2809#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {2795#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {2795#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2795#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {2795#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {2795#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {2795#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2795#(= main_~i~0 0)} is VALID [2022-04-15 12:01:45,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {2795#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2858#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:45,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {2858#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2764#false} is VALID [2022-04-15 12:01:45,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {2764#false} assume 0 != ~a~0 % 4294967296; {2764#false} is VALID [2022-04-15 12:01:45,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-15 12:01:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-15 12:01:45,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:45,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-15 12:01:45,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {2764#false} assume 0 != ~a~0 % 4294967296; {2764#false} is VALID [2022-04-15 12:01:45,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {2874#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {2764#false} is VALID [2022-04-15 12:01:45,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2874#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {2924#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {2928#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2924#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:45,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {2928#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {2928#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:45,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {2928#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:45,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2878#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:45,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {2763#true} is VALID [2022-04-15 12:01:45,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #54#return; {2763#true} is VALID [2022-04-15 12:01:45,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 12:01:45,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2763#true} is VALID [2022-04-15 12:01:45,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {2763#true} call ULTIMATE.init(); {2763#true} is VALID [2022-04-15 12:01:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-15 12:01:45,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315248854] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:45,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2022-04-15 12:01:45,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:45,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1428625968] [2022-04-15 12:01:45,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1428625968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:45,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:45,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:01:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838758290] [2022-04-15 12:01:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:45,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:45,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:45,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:01:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:01:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:01:45,494 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,861 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 12:01:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:01:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-15 12:01:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-15 12:01:45,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-15 12:01:45,897 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 12:01:45,897 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:01:45,897 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:01:45,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:01:45,898 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:45,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:01:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:01:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 12:01:45,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:45,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,913 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,913 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,914 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 12:01:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 12:01:45,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:45,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:45,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:01:45,914 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:01:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,915 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 12:01:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 12:01:45,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:45,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:45,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:45,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 12:01:45,916 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-04-15 12:01:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:45,916 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 12:01:45,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 12:01:45,953 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 12:01:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:01:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:01:45,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:45,953 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:45,983 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 12:01:46,154 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:46,154 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1386206645, now seen corresponding path program 15 times [2022-04-15 12:01:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488989321] [2022-04-15 12:01:46,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,386 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1386206645, now seen corresponding path program 16 times [2022-04-15 12:01:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108503154] [2022-04-15 12:01:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3218#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3204#true} is VALID [2022-04-15 12:01:46,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-15 12:01:46,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3204#true} {3204#true} #54#return; {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {3204#true} call ULTIMATE.init(); {3218#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:46,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3218#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #54#return; {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {3204#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3204#true} is VALID [2022-04-15 12:01:46,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {3204#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3209#(= main_~k~0 0)} is VALID [2022-04-15 12:01:46,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3209#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3209#(= main_~k~0 0)} is VALID [2022-04-15 12:01:46,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {3209#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3210#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:46,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3210#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3210#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:46,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {3210#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3211#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:46,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {3211#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3211#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:46,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {3211#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3212#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:46,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {3212#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3212#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:46,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {3212#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3213#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:46,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {3213#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3213#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:46,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {3213#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3214#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:46,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {3214#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3214#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:46,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {3214#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3215#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:46,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {3215#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3215#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:46,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {3215#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3216#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:46,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {3216#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3216#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:46,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {3216#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3217#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:46,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {3217#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 8))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3205#false} is VALID [2022-04-15 12:01:46,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {3205#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3205#false} is VALID [2022-04-15 12:01:46,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {3205#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3205#false} is VALID [2022-04-15 12:01:46,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {3205#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3205#false} is VALID [2022-04-15 12:01:46,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {3205#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3205#false} is VALID [2022-04-15 12:01:46,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {3205#false} assume 0 != ~a~0 % 4294967296; {3205#false} is VALID [2022-04-15 12:01:46,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-15 12:01:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:46,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108503154] [2022-04-15 12:01:46,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108503154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249428928] [2022-04-15 12:01:46,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:46,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:46,542 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 12:01:46,543 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 12:01:46,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:46,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:46,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:46,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {3204#true} call ULTIMATE.init(); {3204#true} is VALID [2022-04-15 12:01:46,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3204#true} is VALID [2022-04-15 12:01:46,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-15 12:01:46,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #54#return; {3204#true} is VALID [2022-04-15 12:01:46,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3204#true} is VALID [2022-04-15 12:01:46,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {3237#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {3237#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3244#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:46,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3244#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:46,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {3244#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3251#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:01:46,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {3251#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {3237#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {3237#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {3237#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {3237#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {3237#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3237#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {3237#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3306#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:46,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {3306#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3205#false} is VALID [2022-04-15 12:01:46,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {3205#false} assume 0 != ~a~0 % 4294967296; {3205#false} is VALID [2022-04-15 12:01:46,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-15 12:01:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 12:01:46,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:46,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-15 12:01:46,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {3205#false} assume 0 != ~a~0 % 4294967296; {3205#false} is VALID [2022-04-15 12:01:46,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {3322#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3205#false} is VALID [2022-04-15 12:01:46,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3322#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {3378#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {3382#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3378#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:46,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {3382#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3382#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:46,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3382#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:46,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3326#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:46,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3204#true} is VALID [2022-04-15 12:01:46,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #54#return; {3204#true} is VALID [2022-04-15 12:01:46,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-15 12:01:46,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3204#true} is VALID [2022-04-15 12:01:46,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {3204#true} call ULTIMATE.init(); {3204#true} is VALID [2022-04-15 12:01:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 12:01:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249428928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:46,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:46,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2022-04-15 12:01:46,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:46,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488989321] [2022-04-15 12:01:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488989321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:46,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:46,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:01:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421546524] [2022-04-15 12:01:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:46,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:46,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:46,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:46,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:01:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:01:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:01:46,933 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,372 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 12:01:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:01:47,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-15 12:01:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-15 12:01:47,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2022-04-15 12:01:47,416 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 12:01:47,417 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:01:47,417 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:01:47,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:01:47,421 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:47,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:01:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:01:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-15 12:01:47,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:47,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,446 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,446 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,446 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 12:01:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:01:47,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:01:47,447 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:01:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,447 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 12:01:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:01:47,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:47,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-15 12:01:47,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2022-04-15 12:01:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:47,448 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-15 12:01:47,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-15 12:01:47,480 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 12:01:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 12:01:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:01:47,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:47,480 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:47,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 12:01:47,683 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,SelfDestructingSolverStorable11 [2022-04-15 12:01:47,686 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -3218839, now seen corresponding path program 17 times [2022-04-15 12:01:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899338316] [2022-04-15 12:01:47,892 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:47,892 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:48,071 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:48,071 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash -3218839, now seen corresponding path program 18 times [2022-04-15 12:01:48,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:48,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121513223] [2022-04-15 12:01:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {3689#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3674#true} is VALID [2022-04-15 12:01:48,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3674#true} {3674#true} #54#return; {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {3674#true} call ULTIMATE.init(); {3689#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:48,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {3689#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3674#true} {3674#true} #54#return; {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {3674#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3674#true} is VALID [2022-04-15 12:01:48,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {3674#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3674#true} is VALID [2022-04-15 12:01:48,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {3674#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3674#true} is VALID [2022-04-15 12:01:48,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {3674#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3679#(= main_~k~0 0)} is VALID [2022-04-15 12:01:48,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {3679#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3679#(= main_~k~0 0)} is VALID [2022-04-15 12:01:48,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {3679#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3680#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:48,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3680#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3680#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:48,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {3680#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3681#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:48,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3681#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:48,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3682#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:48,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {3682#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3682#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:48,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {3682#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3683#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:48,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {3683#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3683#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:48,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {3683#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3684#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:48,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {3684#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3684#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:48,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {3684#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3685#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:48,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {3685#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3685#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:48,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {3685#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3686#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:48,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {3686#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3686#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:48,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {3686#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3687#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:48,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {3687#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3687#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:48,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {3687#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3688#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {3688#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 9))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {3675#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {3675#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {3675#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {3675#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {3675#false} assume 0 != ~a~0 % 4294967296; {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {3675#false} assume !false; {3675#false} is VALID [2022-04-15 12:01:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121513223] [2022-04-15 12:01:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121513223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169754769] [2022-04-15 12:01:48,239 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:48,240 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 12:01:48,241 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 12:01:48,302 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:48,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:48,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:01:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:48,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {3674#true} call ULTIMATE.init(); {3674#true} is VALID [2022-04-15 12:01:48,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3674#true} is VALID [2022-04-15 12:01:48,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-15 12:01:48,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3674#true} {3674#true} #54#return; {3674#true} is VALID [2022-04-15 12:01:48,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {3674#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3674#true} is VALID [2022-04-15 12:01:48,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {3674#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {3708#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {3708#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {3708#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {3708#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {3708#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {3708#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {3708#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3708#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {3708#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3781#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:48,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {3781#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3675#false} is VALID [2022-04-15 12:01:48,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {3675#false} assume 0 != ~a~0 % 4294967296; {3675#false} is VALID [2022-04-15 12:01:48,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {3675#false} assume !false; {3675#false} is VALID [2022-04-15 12:01:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-15 12:01:48,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:48,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {3675#false} assume !false; {3675#false} is VALID [2022-04-15 12:01:48,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {3675#false} assume 0 != ~a~0 % 4294967296; {3675#false} is VALID [2022-04-15 12:01:48,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {3797#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {3675#false} is VALID [2022-04-15 12:01:48,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3797#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3674#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3801#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:48,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {3674#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {3674#true} is VALID [2022-04-15 12:01:48,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3674#true} {3674#true} #54#return; {3674#true} is VALID [2022-04-15 12:01:48,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-15 12:01:48,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3674#true} is VALID [2022-04-15 12:01:48,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {3674#true} call ULTIMATE.init(); {3674#true} is VALID [2022-04-15 12:01:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-15 12:01:48,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169754769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:48,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:48,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-04-15 12:01:48,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899338316] [2022-04-15 12:01:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899338316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:48,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:48,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:01:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000328938] [2022-04-15 12:01:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:48,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:48,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:48,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:48,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:01:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:01:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:48,618 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,242 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 12:01:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:01:49,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-15 12:01:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-15 12:01:49,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2022-04-15 12:01:49,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,292 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:01:49,292 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:01:49,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:01:49,294 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:49,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:01:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:01:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-15 12:01:49,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:49,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,320 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,320 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,321 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 12:01:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:01:49,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:49,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:49,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:01:49,321 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:01:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,322 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 12:01:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:01:49,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:49,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:49,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:49,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 12:01:49,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2022-04-15 12:01:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:49,323 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 12:01:49,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 12:01:49,358 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 12:01:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:01:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:01:49,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:49,359 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:49,377 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 12:01:49,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:01:49,560 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1903168263, now seen corresponding path program 19 times [2022-04-15 12:01:49,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246936742] [2022-04-15 12:01:49,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:49,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:49,972 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:49,972 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1903168263, now seen corresponding path program 20 times [2022-04-15 12:01:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750193443] [2022-04-15 12:01:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {4185#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4169#true} is VALID [2022-04-15 12:01:50,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {4169#true} assume true; {4169#true} is VALID [2022-04-15 12:01:50,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4169#true} {4169#true} #54#return; {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {4169#true} call ULTIMATE.init(); {4185#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:50,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4185#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {4169#true} assume true; {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4169#true} {4169#true} #54#return; {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {4169#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {4169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4169#true} is VALID [2022-04-15 12:01:50,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {4169#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4169#true} is VALID [2022-04-15 12:01:50,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {4169#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4174#(= main_~k~0 0)} is VALID [2022-04-15 12:01:50,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {4174#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4174#(= main_~k~0 0)} is VALID [2022-04-15 12:01:50,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4174#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4175#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:50,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {4175#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4175#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:50,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {4175#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4176#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:50,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {4176#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4176#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:50,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {4176#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4177#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:50,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4177#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:50,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {4177#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4178#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:50,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {4178#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4178#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:50,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {4178#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4179#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:50,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {4179#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4179#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:50,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {4179#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4180#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:50,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {4180#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4180#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:50,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {4180#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4181#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:50,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {4181#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4181#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:50,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {4181#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4182#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:50,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {4182#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4182#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:50,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {4182#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4183#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:50,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {4183#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4183#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:50,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {4183#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4184#(and (<= main_~k~0 10) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {4184#(and (<= main_~k~0 10) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {4170#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {4170#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {4170#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {4170#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {4170#false} assume 0 != ~a~0 % 4294967296; {4170#false} is VALID [2022-04-15 12:01:50,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {4170#false} assume !false; {4170#false} is VALID [2022-04-15 12:01:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750193443] [2022-04-15 12:01:50,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750193443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977794745] [2022-04-15 12:01:50,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:50,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:50,193 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 12:01:50,193 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 12:01:50,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:50,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:50,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:50,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {4169#true} call ULTIMATE.init(); {4169#true} is VALID [2022-04-15 12:01:50,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {4169#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4169#true} is VALID [2022-04-15 12:01:50,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {4169#true} assume true; {4169#true} is VALID [2022-04-15 12:01:50,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4169#true} {4169#true} #54#return; {4169#true} is VALID [2022-04-15 12:01:50,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {4169#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4169#true} is VALID [2022-04-15 12:01:50,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {4169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {4204#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {4204#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4211#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:50,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {4211#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4211#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:50,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {4211#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4218#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:50,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {4218#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {4204#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {4204#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4204#(= main_~i~0 0)} is VALID [2022-04-15 12:01:50,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4285#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:50,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {4285#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4170#false} is VALID [2022-04-15 12:01:50,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {4170#false} assume 0 != ~a~0 % 4294967296; {4170#false} is VALID [2022-04-15 12:01:50,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {4170#false} assume !false; {4170#false} is VALID [2022-04-15 12:01:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-15 12:01:50,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:50,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {4170#false} assume !false; {4170#false} is VALID [2022-04-15 12:01:50,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {4170#false} assume 0 != ~a~0 % 4294967296; {4170#false} is VALID [2022-04-15 12:01:50,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {4301#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4170#false} is VALID [2022-04-15 12:01:50,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4301#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {4369#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {4373#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4369#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:50,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {4373#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4373#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:50,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4373#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:50,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {4169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4305#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:50,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {4169#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4169#true} is VALID [2022-04-15 12:01:50,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4169#true} {4169#true} #54#return; {4169#true} is VALID [2022-04-15 12:01:50,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {4169#true} assume true; {4169#true} is VALID [2022-04-15 12:01:50,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {4169#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4169#true} is VALID [2022-04-15 12:01:50,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {4169#true} call ULTIMATE.init(); {4169#true} is VALID [2022-04-15 12:01:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-15 12:01:50,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977794745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:50,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:50,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 22 [2022-04-15 12:01:50,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:50,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246936742] [2022-04-15 12:01:50,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246936742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:50,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:50,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:01:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969042978] [2022-04-15 12:01:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:50,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:50,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:01:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:01:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:01:50,677 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,315 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 12:01:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:01:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 12:01:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-15 12:01:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-15 12:01:51,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2022-04-15 12:01:51,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:51,364 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:01:51,364 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:01:51,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:51,364 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:51,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:01:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:01:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-15 12:01:51,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:51,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,391 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,391 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,392 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 12:01:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 12:01:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:51,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:51,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:01:51,392 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:01:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,397 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 12:01:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 12:01:51,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:51,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:51,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:51,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 12:01:51,398 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2022-04-15 12:01:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:51,398 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 12:01:51,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:51,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 12:01:51,433 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 12:01:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:01:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:01:51,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:51,434 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:51,450 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 12:01:51,635 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,SelfDestructingSolverStorable13 [2022-04-15 12:01:51,636 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -9862107, now seen corresponding path program 21 times [2022-04-15 12:01:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:51,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853251787] [2022-04-15 12:01:51,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:51,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:52,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:52,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash -9862107, now seen corresponding path program 22 times [2022-04-15 12:01:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:52,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344100550] [2022-04-15 12:01:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {4714#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4697#true} is VALID [2022-04-15 12:01:52,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4697#true} assume true; {4697#true} is VALID [2022-04-15 12:01:52,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4697#true} {4697#true} #54#return; {4697#true} is VALID [2022-04-15 12:01:52,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {4697#true} call ULTIMATE.init(); {4714#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:52,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4714#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4697#true} is VALID [2022-04-15 12:01:52,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#true} assume true; {4697#true} is VALID [2022-04-15 12:01:52,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#true} {4697#true} #54#return; {4697#true} is VALID [2022-04-15 12:01:52,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4697#true} is VALID [2022-04-15 12:01:52,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4697#true} is VALID [2022-04-15 12:01:52,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {4697#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4697#true} is VALID [2022-04-15 12:01:52,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {4697#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4702#(= main_~k~0 0)} is VALID [2022-04-15 12:01:52,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {4702#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4702#(= main_~k~0 0)} is VALID [2022-04-15 12:01:52,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {4702#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4703#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:52,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {4703#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4703#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:52,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {4703#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4704#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:52,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {4704#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4704#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:52,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {4704#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4705#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:52,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {4705#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4705#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:52,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {4705#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4706#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:52,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {4706#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4706#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:52,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {4706#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4707#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:52,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {4707#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4707#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:52,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {4707#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4708#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:52,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {4708#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4708#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:52,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {4708#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4709#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:52,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {4709#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4709#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:52,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {4709#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4710#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:52,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {4710#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4710#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:52,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {4710#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4711#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:52,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {4711#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4711#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:52,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {4711#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4712#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:52,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {4712#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4712#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:52,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {4712#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4713#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 11))} is VALID [2022-04-15 12:01:52,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {4713#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 11))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4698#false} is VALID [2022-04-15 12:01:52,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4698#false} is VALID [2022-04-15 12:01:52,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {4698#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4698#false} is VALID [2022-04-15 12:01:52,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {4698#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4698#false} is VALID [2022-04-15 12:01:52,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {4698#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4698#false} is VALID [2022-04-15 12:01:52,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {4698#false} assume 0 != ~a~0 % 4294967296; {4698#false} is VALID [2022-04-15 12:01:52,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {4698#false} assume !false; {4698#false} is VALID [2022-04-15 12:01:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344100550] [2022-04-15 12:01:52,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344100550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298244794] [2022-04-15 12:01:52,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:52,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:52,240 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 12:01:52,241 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 12:01:52,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:52,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:52,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:52,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {4697#true} call ULTIMATE.init(); {4697#true} is VALID [2022-04-15 12:01:52,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {4697#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4697#true} is VALID [2022-04-15 12:01:52,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#true} assume true; {4697#true} is VALID [2022-04-15 12:01:52,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#true} {4697#true} #54#return; {4697#true} is VALID [2022-04-15 12:01:52,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4697#true} is VALID [2022-04-15 12:01:52,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {4733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4740#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:52,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {4740#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4740#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:52,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {4740#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4747#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:52,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {4747#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {4733#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {4733#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {4733#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {4733#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {4733#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:52,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {4733#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4820#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:52,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {4820#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4698#false} is VALID [2022-04-15 12:01:52,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {4698#false} assume 0 != ~a~0 % 4294967296; {4698#false} is VALID [2022-04-15 12:01:52,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {4698#false} assume !false; {4698#false} is VALID [2022-04-15 12:01:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-15 12:01:52,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:52,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {4698#false} assume !false; {4698#false} is VALID [2022-04-15 12:01:52,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {4698#false} assume 0 != ~a~0 % 4294967296; {4698#false} is VALID [2022-04-15 12:01:52,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {4836#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {4698#false} is VALID [2022-04-15 12:01:52,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4836#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {4910#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {4914#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4910#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:52,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {4914#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {4914#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:52,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {4914#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:52,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {4840#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:52,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {4697#true} is VALID [2022-04-15 12:01:52,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#true} {4697#true} #54#return; {4697#true} is VALID [2022-04-15 12:01:52,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#true} assume true; {4697#true} is VALID [2022-04-15 12:01:52,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {4697#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {4697#true} is VALID [2022-04-15 12:01:52,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {4697#true} call ULTIMATE.init(); {4697#true} is VALID [2022-04-15 12:01:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-15 12:01:52,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298244794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:52,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:52,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 23 [2022-04-15 12:01:52,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:52,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853251787] [2022-04-15 12:01:52,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853251787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:52,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:52,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:01:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588093] [2022-04-15 12:01:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:01:52,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:52,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:52,788 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 12:01:52,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:01:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:01:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:52,789 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,810 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 12:01:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:01:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:01:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2022-04-15 12:01:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2022-04-15 12:01:53,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 56 transitions. [2022-04-15 12:01:53,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,880 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:01:53,880 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:01:53,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:01:53,881 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:53,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:01:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:01:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-15 12:01:53,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:53,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,916 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,916 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,917 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 12:01:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:01:53,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:01:53,917 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:01:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,918 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 12:01:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:01:53,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:53,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-15 12:01:53,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2022-04-15 12:01:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:53,919 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-15 12:01:53,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-15 12:01:53,956 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 12:01:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 12:01:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:01:53,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:53,956 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:53,973 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 12:01:54,157 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,SelfDestructingSolverStorable14 [2022-04-15 12:01:54,157 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash -186044989, now seen corresponding path program 23 times [2022-04-15 12:01:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:54,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [582566227] [2022-04-15 12:01:54,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:54,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:54,700 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:54,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -186044989, now seen corresponding path program 24 times [2022-04-15 12:01:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:54,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640431897] [2022-04-15 12:01:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:54,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {5272#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5254#true} is VALID [2022-04-15 12:01:54,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {5254#true} assume true; {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5254#true} {5254#true} #54#return; {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {5254#true} call ULTIMATE.init(); {5272#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:54,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {5272#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {5254#true} assume true; {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5254#true} {5254#true} #54#return; {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {5254#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5254#true} is VALID [2022-04-15 12:01:54,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {5254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5254#true} is VALID [2022-04-15 12:01:54,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {5254#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5254#true} is VALID [2022-04-15 12:01:54,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {5254#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {5259#(= main_~k~0 0)} is VALID [2022-04-15 12:01:54,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {5259#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5259#(= main_~k~0 0)} is VALID [2022-04-15 12:01:54,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {5259#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5260#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:54,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {5260#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5260#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:54,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {5260#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5261#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:54,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {5261#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5261#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:54,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {5261#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5262#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:54,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {5262#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5262#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:54,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {5262#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5263#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:54,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {5263#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5263#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:54,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {5263#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5264#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:54,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {5264#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5264#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:54,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {5264#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5265#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:54,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {5265#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5265#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:54,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {5265#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5266#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:54,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {5266#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5266#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:54,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {5266#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5267#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:54,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {5267#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5267#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:54,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {5267#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5268#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:54,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {5268#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5268#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:54,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {5268#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5269#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:54,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {5269#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5269#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:54,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {5269#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5270#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:01:54,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {5270#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5270#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:01:54,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {5270#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5271#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 12))} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {5271#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 12))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {5255#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {5255#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {5255#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {5255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {5255#false} assume 0 != ~a~0 % 4294967296; {5255#false} is VALID [2022-04-15 12:01:54,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {5255#false} assume !false; {5255#false} is VALID [2022-04-15 12:01:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640431897] [2022-04-15 12:01:54,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640431897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262357968] [2022-04-15 12:01:54,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:54,941 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 12:01:54,942 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 12:01:55,002 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:01:55,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:55,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:01:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:55,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:55,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {5254#true} call ULTIMATE.init(); {5254#true} is VALID [2022-04-15 12:01:55,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {5254#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5254#true} is VALID [2022-04-15 12:01:55,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {5254#true} assume true; {5254#true} is VALID [2022-04-15 12:01:55,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5254#true} {5254#true} #54#return; {5254#true} is VALID [2022-04-15 12:01:55,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {5254#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5254#true} is VALID [2022-04-15 12:01:55,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {5254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {5291#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {5291#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {5291#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {5291#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {5291#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {5291#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {5291#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5291#(= main_~i~0 0)} is VALID [2022-04-15 12:01:55,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {5291#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5382#(= main_~i~0 1)} is VALID [2022-04-15 12:01:55,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {5382#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5255#false} is VALID [2022-04-15 12:01:55,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {5255#false} assume 0 != ~a~0 % 4294967296; {5255#false} is VALID [2022-04-15 12:01:55,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {5255#false} assume !false; {5255#false} is VALID [2022-04-15 12:01:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-15 12:01:55,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:55,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {5255#false} assume !false; {5255#false} is VALID [2022-04-15 12:01:55,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {5255#false} assume 0 != ~a~0 % 4294967296; {5255#false} is VALID [2022-04-15 12:01:55,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {5398#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5255#false} is VALID [2022-04-15 12:01:55,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5398#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {5254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5402#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:55,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {5254#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5254#true} is VALID [2022-04-15 12:01:55,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5254#true} {5254#true} #54#return; {5254#true} is VALID [2022-04-15 12:01:55,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {5254#true} assume true; {5254#true} is VALID [2022-04-15 12:01:55,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {5254#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5254#true} is VALID [2022-04-15 12:01:55,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {5254#true} call ULTIMATE.init(); {5254#true} is VALID [2022-04-15 12:01:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-15 12:01:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262357968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:55,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:55,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 20 [2022-04-15 12:01:55,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [582566227] [2022-04-15 12:01:55,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [582566227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:55,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:55,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:01:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631413233] [2022-04-15 12:01:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:01:55,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:55,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:01:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:01:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:01:55,378 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:56,327 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 12:01:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:01:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:01:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-15 12:01:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-15 12:01:56,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 58 transitions. [2022-04-15 12:01:56,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:56,383 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:01:56,383 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:01:56,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:01:56,384 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:56,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:01:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:01:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-15 12:01:56,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:56,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,411 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,411 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:56,412 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 12:01:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:01:56,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:56,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:56,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:01:56,412 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:01:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:56,413 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 12:01:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:01:56,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:56,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:56,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:56,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-15 12:01:56,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2022-04-15 12:01:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:56,414 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-15 12:01:56,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:56,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-15 12:01:56,466 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 12:01:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:01:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:01:56,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:56,466 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:56,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:56,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 12:01:56,683 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1994070047, now seen corresponding path program 25 times [2022-04-15 12:01:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:56,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042680679] [2022-04-15 12:01:56,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:56,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:57,203 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:57,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1994070047, now seen corresponding path program 26 times [2022-04-15 12:01:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365185054] [2022-04-15 12:01:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:57,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {5855#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5836#true} is VALID [2022-04-15 12:01:57,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#true} assume true; {5836#true} is VALID [2022-04-15 12:01:57,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5836#true} {5836#true} #54#return; {5836#true} is VALID [2022-04-15 12:01:57,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5855#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:57,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {5855#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5836#true} is VALID [2022-04-15 12:01:57,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2022-04-15 12:01:57,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #54#return; {5836#true} is VALID [2022-04-15 12:01:57,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5836#true} is VALID [2022-04-15 12:01:57,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {5836#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5836#true} is VALID [2022-04-15 12:01:57,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {5836#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5836#true} is VALID [2022-04-15 12:01:57,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {5836#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {5841#(= main_~k~0 0)} is VALID [2022-04-15 12:01:57,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {5841#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5841#(= main_~k~0 0)} is VALID [2022-04-15 12:01:57,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {5841#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5842#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:57,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {5842#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5842#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:57,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {5842#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5843#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:57,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5843#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:01:57,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {5843#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5844#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:57,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {5844#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5844#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:01:57,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {5844#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5845#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:57,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {5845#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5845#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:01:57,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {5845#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5846#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:57,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5846#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:01:57,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {5846#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5847#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:57,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {5847#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5847#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:01:57,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {5847#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5848#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:57,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {5848#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5848#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:01:57,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {5848#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5849#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:57,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {5849#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5849#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:01:57,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {5849#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5850#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:57,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {5850#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5850#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:01:57,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5851#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:57,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {5851#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5851#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:01:57,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {5851#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5852#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:01:57,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {5852#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5852#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:01:57,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {5852#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5853#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:01:57,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {5853#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5853#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:01:57,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {5853#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5854#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 13))} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {5854#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 13))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {5837#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {5837#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {5837#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {5837#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {5837#false} assume 0 != ~a~0 % 4294967296; {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2022-04-15 12:01:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365185054] [2022-04-15 12:01:57,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365185054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320586544] [2022-04-15 12:01:57,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:57,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:57,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:01:57,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:57,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:57,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:01:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:57,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:57,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2022-04-15 12:01:57,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5836#true} is VALID [2022-04-15 12:01:57,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2022-04-15 12:01:57,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #54#return; {5836#true} is VALID [2022-04-15 12:01:57,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5836#true} is VALID [2022-04-15 12:01:57,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {5836#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {5874#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {5874#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {5881#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:57,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {5881#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5881#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:57,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {5881#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5888#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:01:57,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {5888#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {5874#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {5874#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {5874#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {5874#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {5874#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5874#(= main_~i~0 0)} is VALID [2022-04-15 12:01:57,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {5874#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5973#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:01:57,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {5973#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5837#false} is VALID [2022-04-15 12:01:57,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {5837#false} assume 0 != ~a~0 % 4294967296; {5837#false} is VALID [2022-04-15 12:01:57,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2022-04-15 12:01:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-15 12:01:57,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:57,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2022-04-15 12:01:57,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {5837#false} assume 0 != ~a~0 % 4294967296; {5837#false} is VALID [2022-04-15 12:01:57,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {5989#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {5837#false} is VALID [2022-04-15 12:01:57,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5989#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {6075#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {6079#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6075#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:57,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {6079#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6079#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:57,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {6079#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:01:57,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {5836#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {5993#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:01:57,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {5836#true} is VALID [2022-04-15 12:01:57,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #54#return; {5836#true} is VALID [2022-04-15 12:01:57,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2022-04-15 12:01:57,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {5836#true} is VALID [2022-04-15 12:01:57,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2022-04-15 12:01:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-15 12:01:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320586544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:57,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:57,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 25 [2022-04-15 12:01:57,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042680679] [2022-04-15 12:01:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042680679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:57,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:57,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:01:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909303386] [2022-04-15 12:01:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:57,940 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:01:57,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:57,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:57,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:57,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:01:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:01:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:01:57,983 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:59,299 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-15 12:01:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:01:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:01:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-15 12:01:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-15 12:01:59,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-15 12:01:59,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:59,364 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:01:59,364 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:01:59,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:01:59,365 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:59,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:01:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:01:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-15 12:01:59,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:59,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,392 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,393 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:59,393 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-15 12:01:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 12:01:59,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:59,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:59,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:01:59,394 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:01:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:59,394 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-15 12:01:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 12:01:59,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:59,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:59,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:59,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 12:01:59,395 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2022-04-15 12:01:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:59,396 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 12:01:59,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:59,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 12:01:59,461 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 12:01:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:01:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:01:59,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:59,462 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:59,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:59,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:01:59,663 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -44395905, now seen corresponding path program 27 times [2022-04-15 12:01:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:59,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764622413] [2022-04-15 12:01:59,992 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:59,992 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:00,193 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:00,193 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -44395905, now seen corresponding path program 28 times [2022-04-15 12:02:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:00,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392979172] [2022-04-15 12:02:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:00,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {6471#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {6451#true} is VALID [2022-04-15 12:02:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-15 12:02:00,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6451#true} {6451#true} #54#return; {6451#true} is VALID [2022-04-15 12:02:00,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {6451#true} call ULTIMATE.init(); {6471#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {6471#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6451#true} {6451#true} #54#return; {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {6451#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {6451#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {6451#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {6451#true} is VALID [2022-04-15 12:02:00,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {6451#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {6456#(= main_~k~0 0)} is VALID [2022-04-15 12:02:00,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {6456#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6456#(= main_~k~0 0)} is VALID [2022-04-15 12:02:00,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {6456#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6457#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:00,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {6457#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6457#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:00,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {6457#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6458#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:00,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {6458#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6458#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:00,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {6458#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6459#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:00,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {6459#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6459#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:00,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {6459#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6460#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:00,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {6460#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6460#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:00,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {6460#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6461#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:00,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {6461#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6461#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:00,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6462#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:00,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {6462#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6462#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:00,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {6462#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6463#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:00,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {6463#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6463#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:00,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {6463#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6464#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:00,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {6464#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6464#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:00,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {6464#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6465#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:00,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {6465#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6465#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:00,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {6465#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6466#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:00,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {6466#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6466#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:00,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {6466#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6467#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:00,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {6467#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6467#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:00,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {6467#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6468#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:00,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {6468#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6468#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:00,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {6468#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6469#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:00,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {6469#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6469#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:00,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {6469#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6470#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {6470#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 14))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {6452#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {6452#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {6452#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {6452#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {6452#false} assume 0 != ~a~0 % 4294967296; {6452#false} is VALID [2022-04-15 12:02:00,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {6452#false} assume !false; {6452#false} is VALID [2022-04-15 12:02:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 2 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:00,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392979172] [2022-04-15 12:02:00,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392979172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051195840] [2022-04-15 12:02:00,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:00,477 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:02:00,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:00,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:00,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:02:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:00,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:00,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {6451#true} call ULTIMATE.init(); {6451#true} is VALID [2022-04-15 12:02:00,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {6451#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {6451#true} is VALID [2022-04-15 12:02:00,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-15 12:02:00,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6451#true} {6451#true} #54#return; {6451#true} is VALID [2022-04-15 12:02:00,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {6451#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {6451#true} is VALID [2022-04-15 12:02:00,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {6451#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {6490#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {6490#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {6497#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:00,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {6497#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6497#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:00,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {6497#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6504#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:00,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {6504#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {6490#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {6490#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {6490#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {6490#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {6490#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {6490#(= main_~i~0 0)} is VALID [2022-04-15 12:02:00,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {6490#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6595#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:02:00,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {6595#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {6452#false} is VALID [2022-04-15 12:02:00,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {6452#false} assume 0 != ~a~0 % 4294967296; {6452#false} is VALID [2022-04-15 12:02:00,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {6452#false} assume !false; {6452#false} is VALID [2022-04-15 12:02:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-04-15 12:02:00,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:01,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {6452#false} assume !false; {6452#false} is VALID [2022-04-15 12:02:01,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {6452#false} assume 0 != ~a~0 % 4294967296; {6452#false} is VALID [2022-04-15 12:02:01,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {6611#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {6452#false} is VALID [2022-04-15 12:02:01,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6611#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {6703#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {6707#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6703#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:01,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {6707#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {6707#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:01,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {6707#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:01,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {6451#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {6615#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:01,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {6451#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {6451#true} is VALID [2022-04-15 12:02:01,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6451#true} {6451#true} #54#return; {6451#true} is VALID [2022-04-15 12:02:01,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {6451#true} assume true; {6451#true} is VALID [2022-04-15 12:02:01,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {6451#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {6451#true} is VALID [2022-04-15 12:02:01,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {6451#true} call ULTIMATE.init(); {6451#true} is VALID [2022-04-15 12:02:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-04-15 12:02:01,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051195840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:01,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:01,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 26 [2022-04-15 12:02:01,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764622413] [2022-04-15 12:02:01,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764622413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:01,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:01,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:02:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370813193] [2022-04-15 12:02:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:01,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:02:01,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:01,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:01,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:01,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:02:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:02:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:02:01,107 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,771 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-15 12:02:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:02:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:02:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2022-04-15 12:02:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2022-04-15 12:02:02,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 62 transitions. [2022-04-15 12:02:02,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:02,853 INFO L225 Difference]: With dead ends: 84 [2022-04-15 12:02:02,854 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:02:02,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:02:02,854 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:02,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:02:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:02:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-15 12:02:02,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:02,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,896 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,896 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,897 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-15 12:02:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 12:02:02,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:02,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:02,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:02:02,898 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:02:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:02,898 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-15 12:02:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 12:02:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:02,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:02,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:02,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-04-15 12:02:02,899 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2022-04-15 12:02:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:02,899 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-04-15 12:02:02,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:02,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2022-04-15 12:02:02,958 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 12:02:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 12:02:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:02:02,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:02,958 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:02,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:03,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:03,159 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 986713501, now seen corresponding path program 29 times [2022-04-15 12:02:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:03,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682031770] [2022-04-15 12:02:03,520 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:03,520 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:03,703 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:03,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 986713501, now seen corresponding path program 30 times [2022-04-15 12:02:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:03,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915490044] [2022-04-15 12:02:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:03,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {7116#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7095#true} is VALID [2022-04-15 12:02:03,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {7095#true} assume true; {7095#true} is VALID [2022-04-15 12:02:03,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7095#true} {7095#true} #54#return; {7095#true} is VALID [2022-04-15 12:02:03,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7095#true} call ULTIMATE.init(); {7116#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:03,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {7116#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7095#true} is VALID [2022-04-15 12:02:03,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {7095#true} assume true; {7095#true} is VALID [2022-04-15 12:02:03,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7095#true} {7095#true} #54#return; {7095#true} is VALID [2022-04-15 12:02:03,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {7095#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7095#true} is VALID [2022-04-15 12:02:03,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {7095#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7095#true} is VALID [2022-04-15 12:02:03,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {7095#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7095#true} is VALID [2022-04-15 12:02:03,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {7095#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {7100#(= main_~k~0 0)} is VALID [2022-04-15 12:02:03,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {7100#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7100#(= main_~k~0 0)} is VALID [2022-04-15 12:02:03,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {7100#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7101#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:03,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {7101#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7101#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:03,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {7101#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7102#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:03,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7102#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7102#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:03,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {7102#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7103#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:03,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {7103#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7103#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:03,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {7103#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7104#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:03,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {7104#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7104#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:03,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {7104#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7105#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:03,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {7105#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7105#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:03,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {7105#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7106#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:03,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {7106#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7106#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:03,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7107#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:03,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {7107#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7107#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:03,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7108#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:03,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {7108#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7108#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:03,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {7108#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7109#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:03,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {7109#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7109#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:03,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {7109#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7110#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:03,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {7110#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7110#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:03,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {7110#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7111#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:03,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {7111#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7111#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:03,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {7111#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7112#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:03,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {7112#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7112#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:03,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {7112#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7113#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:03,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {7113#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7113#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:03,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {7113#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7114#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:03,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {7114#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7114#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:03,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {7114#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7115#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {7115#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 15))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {7096#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {7096#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {7096#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {7096#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {7096#false} assume 0 != ~a~0 % 4294967296; {7096#false} is VALID [2022-04-15 12:02:03,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {7096#false} assume !false; {7096#false} is VALID [2022-04-15 12:02:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 2 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915490044] [2022-04-15 12:02:03,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915490044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40687043] [2022-04-15 12:02:03,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:03,995 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:03,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:02:04,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:02:04,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:04,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:02:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:04,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:04,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {7095#true} call ULTIMATE.init(); {7095#true} is VALID [2022-04-15 12:02:04,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {7095#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7095#true} is VALID [2022-04-15 12:02:04,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {7095#true} assume true; {7095#true} is VALID [2022-04-15 12:02:04,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7095#true} {7095#true} #54#return; {7095#true} is VALID [2022-04-15 12:02:04,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {7095#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7095#true} is VALID [2022-04-15 12:02:04,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {7095#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {7135#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {7135#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {7135#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {7135#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {7135#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {7135#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {7135#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7135#(= main_~i~0 0)} is VALID [2022-04-15 12:02:04,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {7135#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7244#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:02:04,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {7244#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7096#false} is VALID [2022-04-15 12:02:04,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {7096#false} assume 0 != ~a~0 % 4294967296; {7096#false} is VALID [2022-04-15 12:02:04,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {7096#false} assume !false; {7096#false} is VALID [2022-04-15 12:02:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-04-15 12:02:04,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:04,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {7096#false} assume !false; {7096#false} is VALID [2022-04-15 12:02:04,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {7096#false} assume 0 != ~a~0 % 4294967296; {7096#false} is VALID [2022-04-15 12:02:04,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {7260#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7096#false} is VALID [2022-04-15 12:02:04,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7260#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {7095#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7264#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:04,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {7095#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7095#true} is VALID [2022-04-15 12:02:04,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7095#true} {7095#true} #54#return; {7095#true} is VALID [2022-04-15 12:02:04,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {7095#true} assume true; {7095#true} is VALID [2022-04-15 12:02:04,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {7095#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7095#true} is VALID [2022-04-15 12:02:04,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {7095#true} call ULTIMATE.init(); {7095#true} is VALID [2022-04-15 12:02:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-04-15 12:02:04,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40687043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:04,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:04,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 4] total 23 [2022-04-15 12:02:04,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:04,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682031770] [2022-04-15 12:02:04,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682031770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:04,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:04,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:02:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321394245] [2022-04-15 12:02:04,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:02:04,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:04,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:02:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:02:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:02:04,490 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:06,564 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-15 12:02:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:02:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:02:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-15 12:02:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-15 12:02:06,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-15 12:02:06,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:06,647 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:02:06,648 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:02:06,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:02:06,648 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:06,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:02:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:02:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-04-15 12:02:06,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:06,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,678 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,678 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:06,679 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-15 12:02:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-15 12:02:06,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:06,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:06,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:02:06,680 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:02:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:06,680 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-15 12:02:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-15 12:02:06,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:06,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:06,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:06,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-15 12:02:06,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-04-15 12:02:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:06,681 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-15 12:02:06,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2022-04-15 12:02:06,750 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 12:02:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 12:02:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:02:06,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:06,751 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:06,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:06,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:06,952 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -254592709, now seen corresponding path program 31 times [2022-04-15 12:02:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312549682] [2022-04-15 12:02:07,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:07,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:07,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:07,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -254592709, now seen corresponding path program 32 times [2022-04-15 12:02:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:07,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971367781] [2022-04-15 12:02:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:08,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {7786#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7764#true} is VALID [2022-04-15 12:02:08,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {7764#true} assume true; {7764#true} is VALID [2022-04-15 12:02:08,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7764#true} {7764#true} #54#return; {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {7764#true} call ULTIMATE.init(); {7786#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:08,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {7786#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {7764#true} assume true; {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7764#true} {7764#true} #54#return; {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {7764#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {7764#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7764#true} is VALID [2022-04-15 12:02:08,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {7764#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7764#true} is VALID [2022-04-15 12:02:08,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {7764#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {7769#(= main_~k~0 0)} is VALID [2022-04-15 12:02:08,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {7769#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7769#(= main_~k~0 0)} is VALID [2022-04-15 12:02:08,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {7769#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7770#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:08,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {7770#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7770#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:08,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {7770#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7771#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:08,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {7771#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7771#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:08,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {7771#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7772#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:08,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {7772#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7772#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:08,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {7772#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7773#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:08,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {7773#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7773#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:08,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {7773#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7774#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:08,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {7774#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7774#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:08,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {7774#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7775#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:08,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {7775#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7775#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:08,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {7775#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7776#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:08,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {7776#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7776#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:08,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {7776#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7777#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:08,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {7777#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7777#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:08,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {7777#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7778#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:08,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {7778#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7778#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:08,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {7778#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7779#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:08,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {7779#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7779#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:08,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {7779#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7780#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:08,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {7780#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7780#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:08,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {7780#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7781#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:08,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {7781#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7781#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:08,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {7781#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7782#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:08,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {7782#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7782#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:08,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {7782#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7783#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:08,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {7783#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7783#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:08,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {7783#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7784#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:08,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {7784#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7784#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:08,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {7784#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7785#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 16))} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {7785#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 16))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {7765#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {7765#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {7765#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {7765#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {7765#false} assume 0 != ~a~0 % 4294967296; {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {7765#false} assume !false; {7765#false} is VALID [2022-04-15 12:02:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971367781] [2022-04-15 12:02:08,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971367781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992475972] [2022-04-15 12:02:08,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:08,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:08,135 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:08,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:02:08,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:08,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:08,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:02:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:08,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:08,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {7764#true} call ULTIMATE.init(); {7764#true} is VALID [2022-04-15 12:02:08,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {7764#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7764#true} is VALID [2022-04-15 12:02:08,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {7764#true} assume true; {7764#true} is VALID [2022-04-15 12:02:08,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7764#true} {7764#true} #54#return; {7764#true} is VALID [2022-04-15 12:02:08,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {7764#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7764#true} is VALID [2022-04-15 12:02:08,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {7764#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {7805#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {7805#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {7812#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:08,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {7812#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7812#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:08,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {7812#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7819#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:02:08,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {7819#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {7805#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {7805#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {7805#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {7805#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {7805#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7805#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {7805#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7922#(= main_~i~0 1)} is VALID [2022-04-15 12:02:08,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {7922#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7765#false} is VALID [2022-04-15 12:02:08,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {7765#false} assume 0 != ~a~0 % 4294967296; {7765#false} is VALID [2022-04-15 12:02:08,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {7765#false} assume !false; {7765#false} is VALID [2022-04-15 12:02:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-04-15 12:02:08,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:08,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {7765#false} assume !false; {7765#false} is VALID [2022-04-15 12:02:08,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {7765#false} assume 0 != ~a~0 % 4294967296; {7765#false} is VALID [2022-04-15 12:02:08,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {7938#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {7765#false} is VALID [2022-04-15 12:02:08,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7938#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {8042#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {8046#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8042#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:08,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {8046#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8046#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:08,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {8046#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:08,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {7764#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {7942#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:08,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {7764#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {7764#true} is VALID [2022-04-15 12:02:08,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7764#true} {7764#true} #54#return; {7764#true} is VALID [2022-04-15 12:02:08,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {7764#true} assume true; {7764#true} is VALID [2022-04-15 12:02:08,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {7764#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {7764#true} is VALID [2022-04-15 12:02:08,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {7764#true} call ULTIMATE.init(); {7764#true} is VALID [2022-04-15 12:02:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-04-15 12:02:08,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992475972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:08,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:08,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 6, 6] total 28 [2022-04-15 12:02:08,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:08,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312549682] [2022-04-15 12:02:08,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312549682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:08,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:08,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:02:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723964756] [2022-04-15 12:02:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:02:08,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:08,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:08,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:08,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:02:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:02:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:02:08,771 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,456 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-15 12:02:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:02:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:02:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-15 12:02:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-15 12:02:11,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 66 transitions. [2022-04-15 12:02:11,542 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 12:02:11,543 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:02:11,543 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:02:11,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:02:11,543 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:11,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:02:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:02:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-15 12:02:11,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:11,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,576 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,576 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,577 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 12:02:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 12:02:11,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 12:02:11,577 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 12:02:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,578 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 12:02:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 12:02:11,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:11,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-15 12:02:11,579 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2022-04-15 12:02:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:11,579 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-15 12:02:11,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2022-04-15 12:02:11,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-15 12:02:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:02:11,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:11,642 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:11,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:02:11,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:11,851 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 851047769, now seen corresponding path program 33 times [2022-04-15 12:02:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:11,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614473054] [2022-04-15 12:02:12,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 851047769, now seen corresponding path program 34 times [2022-04-15 12:02:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971333862] [2022-04-15 12:02:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:12,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {8489#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {8466#true} is VALID [2022-04-15 12:02:12,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {8466#true} assume true; {8466#true} is VALID [2022-04-15 12:02:12,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8466#true} {8466#true} #54#return; {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {8466#true} call ULTIMATE.init(); {8489#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:12,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {8489#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {8466#true} assume true; {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8466#true} {8466#true} #54#return; {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {8466#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {8466#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {8466#true} is VALID [2022-04-15 12:02:12,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {8466#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {8466#true} is VALID [2022-04-15 12:02:12,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {8466#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {8471#(= main_~k~0 0)} is VALID [2022-04-15 12:02:12,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {8471#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8471#(= main_~k~0 0)} is VALID [2022-04-15 12:02:12,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {8471#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8472#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:12,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {8472#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8472#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:12,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {8472#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8473#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:12,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {8473#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8473#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:12,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {8473#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8474#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:12,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8474#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:12,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {8474#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8475#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:12,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {8475#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8475#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:12,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {8475#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8476#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:12,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {8476#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8476#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:12,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {8476#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8477#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:12,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {8477#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8477#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:12,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {8477#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8478#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:12,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {8478#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8478#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:12,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {8478#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8479#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:12,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {8479#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8479#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:12,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {8479#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8480#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:12,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {8480#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8480#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:12,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {8480#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8481#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:12,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {8481#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8481#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:12,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {8481#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8482#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:12,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {8482#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8482#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:12,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {8482#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8483#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:12,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {8483#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8483#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:12,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {8483#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8484#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:12,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {8484#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8484#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:12,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {8484#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8485#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:12,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {8485#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8485#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:12,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {8485#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8486#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:12,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {8486#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8486#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:12,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {8486#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8487#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:12,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {8487#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8487#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {8487#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8488#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {8488#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 17))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {8467#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {8467#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {8467#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {8467#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {8467#false} assume 0 != ~a~0 % 4294967296; {8467#false} is VALID [2022-04-15 12:02:12,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {8467#false} assume !false; {8467#false} is VALID [2022-04-15 12:02:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 2 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971333862] [2022-04-15 12:02:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971333862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442426196] [2022-04-15 12:02:12,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:12,679 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:12,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:02:12,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:12,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:12,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:02:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:12,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:12,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {8466#true} call ULTIMATE.init(); {8466#true} is VALID [2022-04-15 12:02:12,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {8466#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {8466#true} is VALID [2022-04-15 12:02:12,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {8466#true} assume true; {8466#true} is VALID [2022-04-15 12:02:12,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8466#true} {8466#true} #54#return; {8466#true} is VALID [2022-04-15 12:02:12,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {8466#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {8466#true} is VALID [2022-04-15 12:02:12,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {8466#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {8508#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {8508#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {8515#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:12,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {8515#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8515#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:12,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {8515#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8522#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:12,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {8522#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {8508#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {8508#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {8508#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {8508#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {8508#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {8508#(= main_~i~0 0)} is VALID [2022-04-15 12:02:12,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {8508#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8631#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:02:12,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {8631#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {8467#false} is VALID [2022-04-15 12:02:12,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {8467#false} assume 0 != ~a~0 % 4294967296; {8467#false} is VALID [2022-04-15 12:02:12,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {8467#false} assume !false; {8467#false} is VALID [2022-04-15 12:02:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-04-15 12:02:12,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:13,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {8467#false} assume !false; {8467#false} is VALID [2022-04-15 12:02:13,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {8467#false} assume 0 != ~a~0 % 4294967296; {8467#false} is VALID [2022-04-15 12:02:13,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {8647#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {8467#false} is VALID [2022-04-15 12:02:13,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8647#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {8757#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {8761#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {8757#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:13,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {8761#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {8761#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:13,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {8761#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:13,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {8466#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {8651#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:13,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {8466#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {8466#true} is VALID [2022-04-15 12:02:13,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8466#true} {8466#true} #54#return; {8466#true} is VALID [2022-04-15 12:02:13,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {8466#true} assume true; {8466#true} is VALID [2022-04-15 12:02:13,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {8466#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {8466#true} is VALID [2022-04-15 12:02:13,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {8466#true} call ULTIMATE.init(); {8466#true} is VALID [2022-04-15 12:02:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-04-15 12:02:13,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442426196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:13,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 6] total 29 [2022-04-15 12:02:13,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:13,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [614473054] [2022-04-15 12:02:13,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [614473054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:13,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:02:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465295096] [2022-04-15 12:02:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:13,277 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:02:13,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:13,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:13,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:13,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:02:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:02:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:02:13,353 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:17,078 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-15 12:02:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:02:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:02:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2022-04-15 12:02:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2022-04-15 12:02:17,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 68 transitions. [2022-04-15 12:02:17,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:17,232 INFO L225 Difference]: With dead ends: 96 [2022-04-15 12:02:17,232 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 12:02:17,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:02:17,233 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:17,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 96 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 12:02:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 12:02:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-15 12:02:17,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:17,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,271 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,271 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:17,272 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-15 12:02:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-04-15 12:02:17,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:17,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:17,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:02:17,272 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:02:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:17,273 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-15 12:02:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-04-15 12:02:17,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:17,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:17,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:17,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-15 12:02:17,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-04-15 12:02:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:17,274 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-15 12:02:17,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:17,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-15 12:02:17,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 12:02:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:02:17,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:17,396 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:17,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 12:02:17,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:17,596 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1780342281, now seen corresponding path program 35 times [2022-04-15 12:02:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:17,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200400034] [2022-04-15 12:02:17,981 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:17,981 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:18,716 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:18,716 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1780342281, now seen corresponding path program 36 times [2022-04-15 12:02:18,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:18,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567162399] [2022-04-15 12:02:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:19,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {9221#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9197#true} is VALID [2022-04-15 12:02:19,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {9197#true} assume true; {9197#true} is VALID [2022-04-15 12:02:19,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9197#true} {9197#true} #54#return; {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {9197#true} call ULTIMATE.init(); {9221#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:19,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {9221#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {9197#true} assume true; {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9197#true} {9197#true} #54#return; {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {9197#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {9197#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {9197#true} is VALID [2022-04-15 12:02:19,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {9197#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {9197#true} is VALID [2022-04-15 12:02:19,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {9197#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {9202#(= main_~k~0 0)} is VALID [2022-04-15 12:02:19,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {9202#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9202#(= main_~k~0 0)} is VALID [2022-04-15 12:02:19,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {9202#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9203#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:19,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {9203#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9203#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:19,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {9203#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9204#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:19,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {9204#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9204#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:19,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {9204#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9205#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:19,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {9205#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9205#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:19,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {9205#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9206#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:19,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {9206#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9206#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:19,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {9206#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9207#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:19,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {9207#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9207#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:19,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {9207#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9208#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:19,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {9208#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9208#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:19,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {9208#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9209#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:19,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {9209#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9209#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:19,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {9209#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9210#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:19,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {9210#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9210#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:19,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {9210#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9211#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:19,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {9211#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9211#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:19,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {9211#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9212#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:19,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {9212#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9212#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:19,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {9212#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9213#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:19,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {9213#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9213#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:19,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {9213#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9214#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:19,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {9214#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9214#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:19,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {9214#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9215#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:19,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {9215#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9215#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:19,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {9215#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9216#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:19,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {9216#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9216#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:19,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {9216#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9217#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:19,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {9217#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9217#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:19,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {9217#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9218#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:19,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {9218#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9218#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:19,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {9218#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9219#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:19,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {9219#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9219#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {9219#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9220#(and (<= main_~k~0 18) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {9220#(and (<= main_~k~0 18) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {9198#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {9198#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {9198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {9198#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {9198#false} assume 0 != ~a~0 % 4294967296; {9198#false} is VALID [2022-04-15 12:02:19,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {9198#false} assume !false; {9198#false} is VALID [2022-04-15 12:02:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 2 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:19,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567162399] [2022-04-15 12:02:19,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567162399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:19,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761566494] [2022-04-15 12:02:19,057 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:19,058 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:19,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:02:19,133 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:02:19,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:19,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:02:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:19,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:19,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {9197#true} call ULTIMATE.init(); {9197#true} is VALID [2022-04-15 12:02:19,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {9197#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9197#true} is VALID [2022-04-15 12:02:19,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {9197#true} assume true; {9197#true} is VALID [2022-04-15 12:02:19,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9197#true} {9197#true} #54#return; {9197#true} is VALID [2022-04-15 12:02:19,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {9197#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9197#true} is VALID [2022-04-15 12:02:19,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {9197#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {9240#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {9240#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {9240#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {9240#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {9240#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {9240#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {9240#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {9240#(= main_~i~0 0)} is VALID [2022-04-15 12:02:19,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {9240#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9367#(= main_~i~0 1)} is VALID [2022-04-15 12:02:19,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {9367#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9198#false} is VALID [2022-04-15 12:02:19,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {9198#false} assume 0 != ~a~0 % 4294967296; {9198#false} is VALID [2022-04-15 12:02:19,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {9198#false} assume !false; {9198#false} is VALID [2022-04-15 12:02:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-15 12:02:19,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:19,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {9198#false} assume !false; {9198#false} is VALID [2022-04-15 12:02:19,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {9198#false} assume 0 != ~a~0 % 4294967296; {9198#false} is VALID [2022-04-15 12:02:19,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {9383#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9198#false} is VALID [2022-04-15 12:02:19,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9383#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {9197#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {9387#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:19,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {9197#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9197#true} is VALID [2022-04-15 12:02:19,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9197#true} {9197#true} #54#return; {9197#true} is VALID [2022-04-15 12:02:19,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {9197#true} assume true; {9197#true} is VALID [2022-04-15 12:02:19,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {9197#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9197#true} is VALID [2022-04-15 12:02:19,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {9197#true} call ULTIMATE.init(); {9197#true} is VALID [2022-04-15 12:02:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-15 12:02:19,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761566494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:19,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:19,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4, 4] total 26 [2022-04-15 12:02:19,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:19,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200400034] [2022-04-15 12:02:19,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200400034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:19,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:19,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:02:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580449537] [2022-04-15 12:02:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:19,516 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:02:19,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:19,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:19,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:19,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:02:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:02:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:02:19,605 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:24,479 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-15 12:02:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:02:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:02:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 12:02:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 12:02:24,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 70 transitions. [2022-04-15 12:02:24,633 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 12:02:24,634 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:02:24,634 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:02:24,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:02:24,635 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:24,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:02:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:02:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-04-15 12:02:24,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:24,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,675 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,675 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:24,676 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-04-15 12:02:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-15 12:02:24,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:24,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:24,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:02:24,676 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:02:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:24,691 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-04-15 12:02:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-15 12:02:24,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:24,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:24,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:24,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-04-15 12:02:24,693 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2022-04-15 12:02:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:24,693 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-04-15 12:02:24,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:24,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2022-04-15 12:02:24,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-04-15 12:02:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:02:24,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:24,887 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:24,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:25,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:25,088 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash -810442987, now seen corresponding path program 37 times [2022-04-15 12:02:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:25,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817037456] [2022-04-15 12:02:25,317 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:25,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:25,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:25,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash -810442987, now seen corresponding path program 38 times [2022-04-15 12:02:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:25,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869139285] [2022-04-15 12:02:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:25,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {9978#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9953#true} is VALID [2022-04-15 12:02:25,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {9953#true} assume true; {9953#true} is VALID [2022-04-15 12:02:25,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9953#true} {9953#true} #54#return; {9953#true} is VALID [2022-04-15 12:02:25,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {9953#true} call ULTIMATE.init(); {9978#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:25,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {9978#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9953#true} is VALID [2022-04-15 12:02:25,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {9953#true} assume true; {9953#true} is VALID [2022-04-15 12:02:25,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9953#true} {9953#true} #54#return; {9953#true} is VALID [2022-04-15 12:02:25,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {9953#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9953#true} is VALID [2022-04-15 12:02:25,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {9953#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {9953#true} is VALID [2022-04-15 12:02:25,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {9953#true} is VALID [2022-04-15 12:02:25,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {9953#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {9958#(= main_~k~0 0)} is VALID [2022-04-15 12:02:25,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {9958#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9958#(= main_~k~0 0)} is VALID [2022-04-15 12:02:25,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {9958#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9959#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:25,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {9959#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9959#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:25,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {9959#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9960#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:25,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {9960#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9960#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:25,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {9960#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9961#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:25,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {9961#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9961#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:25,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {9961#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9962#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:25,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {9962#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9962#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:25,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {9962#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9963#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:25,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {9963#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9963#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:25,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {9963#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9964#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:25,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {9964#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9964#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:25,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {9964#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9965#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:25,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {9965#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9965#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:25,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {9965#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9966#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:25,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {9966#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9966#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:25,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {9966#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9967#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:25,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {9967#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9967#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:25,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {9967#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9968#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:25,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {9968#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9968#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:25,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {9968#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9969#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:25,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {9969#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9969#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:25,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {9969#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9970#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:25,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {9970#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9970#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:25,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {9970#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9971#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:25,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {9971#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9971#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:25,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {9971#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9972#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:25,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {9972#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9972#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:25,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {9972#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9973#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:25,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {9973#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9973#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:25,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {9973#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9974#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:25,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9974#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:25,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9975#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:25,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {9975#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9975#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:25,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {9975#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9976#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:25,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {9976#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9976#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {9976#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9977#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 19))} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {9977#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 19))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {9954#false} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {9954#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9954#false} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {9954#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {9954#false} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {9954#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9954#false} is VALID [2022-04-15 12:02:25,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {9954#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9954#false} is VALID [2022-04-15 12:02:25,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {9954#false} assume 0 != ~a~0 % 4294967296; {9954#false} is VALID [2022-04-15 12:02:25,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {9954#false} assume !false; {9954#false} is VALID [2022-04-15 12:02:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 2 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869139285] [2022-04-15 12:02:25,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869139285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350783827] [2022-04-15 12:02:25,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:25,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:25,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:25,918 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:25,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:02:26,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:26,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:26,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:02:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:26,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:26,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {9953#true} call ULTIMATE.init(); {9953#true} is VALID [2022-04-15 12:02:26,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {9953#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9953#true} is VALID [2022-04-15 12:02:26,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {9953#true} assume true; {9953#true} is VALID [2022-04-15 12:02:26,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9953#true} {9953#true} #54#return; {9953#true} is VALID [2022-04-15 12:02:26,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {9953#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9953#true} is VALID [2022-04-15 12:02:26,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {9953#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {9997#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {10004#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:26,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {10004#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10004#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:26,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {10004#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10011#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:02:26,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {10011#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {9997#(= main_~i~0 0)} is VALID [2022-04-15 12:02:26,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {9997#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10132#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:02:26,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {10132#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9954#false} is VALID [2022-04-15 12:02:26,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {9954#false} assume 0 != ~a~0 % 4294967296; {9954#false} is VALID [2022-04-15 12:02:26,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {9954#false} assume !false; {9954#false} is VALID [2022-04-15 12:02:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-04-15 12:02:26,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:26,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {9954#false} assume !false; {9954#false} is VALID [2022-04-15 12:02:26,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {9954#false} assume 0 != ~a~0 % 4294967296; {9954#false} is VALID [2022-04-15 12:02:26,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {10148#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {9954#false} is VALID [2022-04-15 12:02:26,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10148#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {10270#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {10274#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10270#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:26,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {10274#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10274#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:26,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {10274#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:26,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {9953#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {10152#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:26,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {9953#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {9953#true} is VALID [2022-04-15 12:02:26,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9953#true} {9953#true} #54#return; {9953#true} is VALID [2022-04-15 12:02:26,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {9953#true} assume true; {9953#true} is VALID [2022-04-15 12:02:26,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {9953#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {9953#true} is VALID [2022-04-15 12:02:26,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {9953#true} call ULTIMATE.init(); {9953#true} is VALID [2022-04-15 12:02:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-04-15 12:02:26,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350783827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:26,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:26,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 6, 6] total 31 [2022-04-15 12:02:26,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:26,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817037456] [2022-04-15 12:02:26,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817037456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:26,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:26,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:02:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291200252] [2022-04-15 12:02:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:02:26,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:26,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:26,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:26,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:02:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:02:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:02:26,696 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,746 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-15 12:02:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:02:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:02:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2022-04-15 12:02:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2022-04-15 12:02:33,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 72 transitions. [2022-04-15 12:02:33,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:33,924 INFO L225 Difference]: With dead ends: 104 [2022-04-15 12:02:33,924 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 12:02:33,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:02:33,925 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:33,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 12:02:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 12:02:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-15 12:02:33,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:33,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,964 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,964 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,965 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-04-15 12:02:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-15 12:02:33,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:02:33,966 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:02:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,966 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-04-15 12:02:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-15 12:02:33,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:33,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-15 12:02:33,967 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2022-04-15 12:02:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:33,967 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-15 12:02:33,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 58 transitions. [2022-04-15 12:02:34,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-15 12:02:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:02:34,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:34,064 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:34,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:34,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:34,270 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -745124685, now seen corresponding path program 39 times [2022-04-15 12:02:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:34,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812484187] [2022-04-15 12:02:34,833 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:34,833 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:35,234 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:35,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -745124685, now seen corresponding path program 40 times [2022-04-15 12:02:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125036396] [2022-04-15 12:02:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {10768#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {10742#true} is VALID [2022-04-15 12:02:35,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {10742#true} assume true; {10742#true} is VALID [2022-04-15 12:02:35,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10742#true} {10742#true} #54#return; {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {10742#true} call ULTIMATE.init(); {10768#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:35,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {10768#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {10742#true} assume true; {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10742#true} {10742#true} #54#return; {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {10742#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {10742#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {10742#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {10742#true} is VALID [2022-04-15 12:02:35,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {10742#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {10747#(= main_~k~0 0)} is VALID [2022-04-15 12:02:35,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {10747#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10747#(= main_~k~0 0)} is VALID [2022-04-15 12:02:35,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {10747#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10748#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:35,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {10748#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10748#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:35,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {10748#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10749#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:35,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {10749#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10749#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:35,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {10749#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10750#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:35,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {10750#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10750#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:35,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {10750#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10751#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:35,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {10751#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10751#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:35,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {10751#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10752#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:35,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {10752#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10752#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:35,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {10752#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10753#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:35,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {10753#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10753#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:35,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {10753#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10754#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:35,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {10754#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10754#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:35,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {10754#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10755#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:35,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {10755#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10755#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:35,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10756#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:35,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10756#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:35,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {10756#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10757#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:35,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {10757#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10757#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:35,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {10757#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10758#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:35,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {10758#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10758#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:35,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {10758#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10759#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:35,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {10759#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10759#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:35,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {10759#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10760#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:35,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {10760#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10760#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:35,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {10760#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10761#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:35,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {10761#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10761#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:35,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {10761#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10762#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:35,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {10762#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10762#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:35,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {10762#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10763#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:35,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {10763#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10763#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:35,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {10763#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10764#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:35,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {10764#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10764#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:35,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {10764#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10765#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:35,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {10765#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10765#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:35,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {10765#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10766#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:02:35,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {10766#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10766#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:02:35,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {10766#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10767#(and (<= main_~k~0 20) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:35,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {10767#(and (<= main_~k~0 20) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 49: Hoare triple {10743#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {10743#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {10743#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {10743#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {10743#false} assume 0 != ~a~0 % 4294967296; {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L290 TraceCheckUtils]: 54: Hoare triple {10743#false} assume !false; {10743#false} is VALID [2022-04-15 12:02:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 2 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125036396] [2022-04-15 12:02:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125036396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379539257] [2022-04-15 12:02:35,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:35,632 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:02:35,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:35,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:35,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:02:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:35,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:35,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {10742#true} call ULTIMATE.init(); {10742#true} is VALID [2022-04-15 12:02:35,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {10742#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {10742#true} is VALID [2022-04-15 12:02:35,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {10742#true} assume true; {10742#true} is VALID [2022-04-15 12:02:35,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10742#true} {10742#true} #54#return; {10742#true} is VALID [2022-04-15 12:02:35,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {10742#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {10742#true} is VALID [2022-04-15 12:02:35,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {10742#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {10787#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {10787#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {10794#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:35,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {10794#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10794#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:35,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {10794#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10801#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:02:35,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {10801#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {10787#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {10787#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {10787#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {10787#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {10787#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {10787#(= main_~i~0 0)} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {10787#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10928#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {10928#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {10743#false} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {10743#false} assume 0 != ~a~0 % 4294967296; {10743#false} is VALID [2022-04-15 12:02:35,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {10743#false} assume !false; {10743#false} is VALID [2022-04-15 12:02:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-04-15 12:02:35,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:36,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {10743#false} assume !false; {10743#false} is VALID [2022-04-15 12:02:36,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {10743#false} assume 0 != ~a~0 % 4294967296; {10743#false} is VALID [2022-04-15 12:02:36,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {10944#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {10743#false} is VALID [2022-04-15 12:02:36,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10944#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {11072#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11072#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:36,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11076#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:36,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {11076#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:02:36,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {10742#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {10948#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:36,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {10742#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {10742#true} is VALID [2022-04-15 12:02:36,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10742#true} {10742#true} #54#return; {10742#true} is VALID [2022-04-15 12:02:36,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {10742#true} assume true; {10742#true} is VALID [2022-04-15 12:02:36,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {10742#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {10742#true} is VALID [2022-04-15 12:02:36,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {10742#true} call ULTIMATE.init(); {10742#true} is VALID [2022-04-15 12:02:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-04-15 12:02:36,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379539257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:36,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:36,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 6, 6] total 32 [2022-04-15 12:02:36,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:36,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812484187] [2022-04-15 12:02:36,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812484187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:36,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:36,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:02:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929999306] [2022-04-15 12:02:36,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:02:36,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:36,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,458 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 12:02:36,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:02:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:02:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:02:36,459 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:45,514 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-15 12:02:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:02:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:02:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-15 12:02:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-15 12:02:45,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 74 transitions. [2022-04-15 12:02:45,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:45,742 INFO L225 Difference]: With dead ends: 108 [2022-04-15 12:02:45,742 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 12:02:45,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:02:45,743 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:45,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:02:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 12:02:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-04-15 12:02:45,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:45,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,782 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,782 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:45,783 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 12:02:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 12:02:45,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:45,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:45,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 12:02:45,783 INFO L87 Difference]: Start difference. First operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 12:02:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:45,784 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 12:02:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 12:02:45,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:45,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:45,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:45,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-15 12:02:45,785 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2022-04-15 12:02:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:45,785 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-15 12:02:45,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:45,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2022-04-15 12:02:45,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-15 12:02:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:02:45,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:45,999 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:46,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 12:02:46,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 12:02:46,200 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1896221393, now seen corresponding path program 41 times [2022-04-15 12:02:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077600632] [2022-04-15 12:02:46,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:46,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:47,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:47,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1896221393, now seen corresponding path program 42 times [2022-04-15 12:02:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:47,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013519888] [2022-04-15 12:02:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:48,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {11560#true} is VALID [2022-04-15 12:02:48,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {11560#true} assume true; {11560#true} is VALID [2022-04-15 12:02:48,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11560#true} {11560#true} #54#return; {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {11560#true} call ULTIMATE.init(); {11587#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:48,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {11560#true} assume true; {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11560#true} {11560#true} #54#return; {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {11560#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {11560#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {11560#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {11560#true} is VALID [2022-04-15 12:02:48,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {11560#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {11565#(= main_~k~0 0)} is VALID [2022-04-15 12:02:48,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {11565#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11565#(= main_~k~0 0)} is VALID [2022-04-15 12:02:48,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {11565#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11566#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:48,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {11566#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11566#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:02:48,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {11566#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11567#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:48,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {11567#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11567#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:02:48,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {11567#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11568#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:48,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {11568#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11568#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:02:48,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {11568#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11569#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:48,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {11569#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11569#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:02:48,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {11569#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11570#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:48,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {11570#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11570#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:02:48,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {11570#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11571#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:48,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {11571#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11571#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:02:48,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {11571#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11572#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:48,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {11572#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11572#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:02:48,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {11572#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11573#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:48,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {11573#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11573#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:02:48,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {11573#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11574#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:48,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {11574#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11574#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:02:48,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {11574#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11575#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:48,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {11575#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11575#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:02:48,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {11575#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11576#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:48,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {11576#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11576#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:02:48,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {11576#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11577#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:48,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {11577#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11577#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:02:48,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {11577#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11578#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:48,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {11578#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11578#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:02:48,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {11578#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11579#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:48,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {11579#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11579#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:02:48,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {11579#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11580#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:48,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {11580#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11580#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:02:48,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {11580#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11581#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:48,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {11581#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11581#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:02:48,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {11581#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11582#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:48,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {11582#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11582#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:02:48,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {11582#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11583#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:48,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {11583#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11583#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:02:48,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {11583#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11584#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:02:48,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {11584#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11584#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:02:48,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {11584#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11585#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:02:48,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {11585#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11585#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:02:48,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {11585#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11586#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 21))} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {11586#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 21))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {11561#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {11561#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {11561#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {11561#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {11561#false} assume 0 != ~a~0 % 4294967296; {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {11561#false} assume !false; {11561#false} is VALID [2022-04-15 12:02:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 2 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013519888] [2022-04-15 12:02:48,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013519888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519460822] [2022-04-15 12:02:48,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:48,371 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:48,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:02:48,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:02:48,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:48,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:02:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:48,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {11560#true} call ULTIMATE.init(); {11560#true} is VALID [2022-04-15 12:02:48,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {11560#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {11560#true} is VALID [2022-04-15 12:02:48,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {11560#true} assume true; {11560#true} is VALID [2022-04-15 12:02:48,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11560#true} {11560#true} #54#return; {11560#true} is VALID [2022-04-15 12:02:48,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {11560#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {11560#true} is VALID [2022-04-15 12:02:48,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {11560#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {11606#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {11606#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {11606#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {11606#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {11606#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {11606#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {11606#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {11606#(= main_~i~0 0)} is VALID [2022-04-15 12:02:48,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {11606#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11751#(= main_~i~0 1)} is VALID [2022-04-15 12:02:48,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {11751#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {11561#false} is VALID [2022-04-15 12:02:48,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {11561#false} assume 0 != ~a~0 % 4294967296; {11561#false} is VALID [2022-04-15 12:02:48,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {11561#false} assume !false; {11561#false} is VALID [2022-04-15 12:02:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-15 12:02:48,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:48,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {11561#false} assume !false; {11561#false} is VALID [2022-04-15 12:02:48,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {11561#false} assume 0 != ~a~0 % 4294967296; {11561#false} is VALID [2022-04-15 12:02:48,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {11767#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {11561#false} is VALID [2022-04-15 12:02:48,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11767#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {11560#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {11771#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:02:48,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {11560#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {11560#true} is VALID [2022-04-15 12:02:48,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11560#true} {11560#true} #54#return; {11560#true} is VALID [2022-04-15 12:02:48,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {11560#true} assume true; {11560#true} is VALID [2022-04-15 12:02:48,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {11560#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {11560#true} is VALID [2022-04-15 12:02:48,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {11560#true} call ULTIMATE.init(); {11560#true} is VALID [2022-04-15 12:02:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-15 12:02:48,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519460822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:48,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 4] total 29 [2022-04-15 12:02:48,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077600632] [2022-04-15 12:02:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077600632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:48,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:02:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139489699] [2022-04-15 12:02:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:02:48,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:48,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:49,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:49,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:02:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:02:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:02:49,118 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,234 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-04-15 12:03:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:03:01,234 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:03:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2022-04-15 12:03:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2022-04-15 12:03:01,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 76 transitions. [2022-04-15 12:03:01,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:01,506 INFO L225 Difference]: With dead ends: 112 [2022-04-15 12:03:01,506 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:03:01,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:03:01,506 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:01,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 176 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 12:03:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:03:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-04-15 12:03:01,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:01,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,548 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,548 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,549 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-15 12:03:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-15 12:03:01,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:01,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:01,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:03:01,550 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:03:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,550 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-15 12:03:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-15 12:03:01,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:01,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:01,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:01,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-15 12:03:01,551 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2022-04-15 12:03:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:01,551 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-15 12:03:01,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:01,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-15 12:03:01,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 12:03:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:03:01,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:01,759 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:01,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:01,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 12:03:01,971 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1904130415, now seen corresponding path program 43 times [2022-04-15 12:03:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:01,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088776717] [2022-04-15 12:03:02,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:02,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:03,665 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:03,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1904130415, now seen corresponding path program 44 times [2022-04-15 12:03:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234775217] [2022-04-15 12:03:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {12431#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {12403#true} is VALID [2022-04-15 12:03:04,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {12403#true} assume true; {12403#true} is VALID [2022-04-15 12:03:04,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12403#true} {12403#true} #54#return; {12403#true} is VALID [2022-04-15 12:03:04,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {12403#true} call ULTIMATE.init(); {12431#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {12431#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {12403#true} assume true; {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12403#true} {12403#true} #54#return; {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {12403#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {12403#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {12403#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {12403#true} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {12403#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {12408#(= main_~k~0 0)} is VALID [2022-04-15 12:03:04,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {12408#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12408#(= main_~k~0 0)} is VALID [2022-04-15 12:03:04,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {12408#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12409#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:04,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {12409#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12409#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:04,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12410#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:04,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {12410#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12410#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:04,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {12410#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12411#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:04,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {12411#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12411#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:04,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {12411#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12412#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:04,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {12412#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12412#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:04,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {12412#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12413#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:04,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {12413#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12413#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:04,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {12413#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12414#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:04,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {12414#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12414#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:04,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {12414#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12415#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:04,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {12415#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12415#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:04,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {12415#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12416#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:04,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {12416#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12416#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:04,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {12416#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12417#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:04,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {12417#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12417#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:04,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {12417#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12418#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:04,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {12418#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12418#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:04,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {12418#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12419#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:04,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {12419#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12419#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:04,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {12419#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12420#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:04,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {12420#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12420#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:04,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {12420#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12421#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:04,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {12421#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12421#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:04,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {12421#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12422#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:04,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {12422#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12422#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:04,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {12422#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12423#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:04,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {12423#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12423#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:04,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {12423#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12424#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:04,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {12424#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12424#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:04,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {12424#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12425#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:04,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {12425#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12425#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:04,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {12425#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12426#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:04,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {12426#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12426#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:04,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {12426#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12427#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:04,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12427#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:04,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12428#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:04,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {12428#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12428#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:04,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {12428#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12429#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:04,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {12429#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12429#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:04,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {12429#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12430#(and (<= main_~k~0 22) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {12430#(and (<= main_~k~0 22) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {12404#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {12404#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {12404#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {12404#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {12404#false} assume 0 != ~a~0 % 4294967296; {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {12404#false} assume !false; {12404#false} is VALID [2022-04-15 12:03:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234775217] [2022-04-15 12:03:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234775217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563286756] [2022-04-15 12:03:04,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:03:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:04,128 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:04,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:03:04,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:03:04,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:04,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:03:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:04,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {12403#true} call ULTIMATE.init(); {12403#true} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {12403#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {12403#true} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {12403#true} assume true; {12403#true} is VALID [2022-04-15 12:03:04,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12403#true} {12403#true} #54#return; {12403#true} is VALID [2022-04-15 12:03:04,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {12403#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {12403#true} is VALID [2022-04-15 12:03:04,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {12403#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {12450#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {12450#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {12457#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:03:04,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {12457#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12457#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:03:04,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {12457#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12464#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:03:04,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {12464#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {12450#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {12450#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {12450#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {12450#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {12450#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {12450#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {12450#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12603#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:04,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {12603#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {12404#false} is VALID [2022-04-15 12:03:04,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {12404#false} assume 0 != ~a~0 % 4294967296; {12404#false} is VALID [2022-04-15 12:03:04,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {12404#false} assume !false; {12404#false} is VALID [2022-04-15 12:03:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-04-15 12:03:04,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:04,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {12404#false} assume !false; {12404#false} is VALID [2022-04-15 12:03:04,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {12404#false} assume 0 != ~a~0 % 4294967296; {12404#false} is VALID [2022-04-15 12:03:04,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {12619#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {12404#false} is VALID [2022-04-15 12:03:04,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12619#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {12759#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {12763#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12759#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:04,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {12763#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {12763#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:04,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {12763#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:04,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {12403#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {12623#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:04,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {12403#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {12403#true} is VALID [2022-04-15 12:03:04,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12403#true} {12403#true} #54#return; {12403#true} is VALID [2022-04-15 12:03:04,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {12403#true} assume true; {12403#true} is VALID [2022-04-15 12:03:04,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12403#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {12403#true} is VALID [2022-04-15 12:03:04,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {12403#true} call ULTIMATE.init(); {12403#true} is VALID [2022-04-15 12:03:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-04-15 12:03:04,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563286756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:04,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6, 6] total 34 [2022-04-15 12:03:04,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088776717] [2022-04-15 12:03:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088776717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:03:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306690471] [2022-04-15 12:03:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:04,926 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:03:04,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:04,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:05,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:05,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:03:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:03:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:03:05,327 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:20,341 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-04-15 12:03:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:03:20,341 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:03:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2022-04-15 12:03:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2022-04-15 12:03:20,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 78 transitions. [2022-04-15 12:03:20,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:20,706 INFO L225 Difference]: With dead ends: 116 [2022-04-15 12:03:20,706 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 12:03:20,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:03:20,707 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:20,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 166 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 12:03:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 12:03:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-15 12:03:20,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:20,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,755 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,755 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:20,756 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-04-15 12:03:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-04-15 12:03:20,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:20,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:20,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:03:20,756 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:03:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:20,757 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-04-15 12:03:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-04-15 12:03:20,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:20,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:20,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:20,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-15 12:03:20,758 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2022-04-15 12:03:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:20,758 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-15 12:03:20,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:20,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2022-04-15 12:03:21,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-15 12:03:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:03:21,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:21,106 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:21,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:21,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:03:21,307 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 914765965, now seen corresponding path program 45 times [2022-04-15 12:03:21,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [845745497] [2022-04-15 12:03:21,857 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:21,857 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:22,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:22,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 914765965, now seen corresponding path program 46 times [2022-04-15 12:03:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:22,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258304164] [2022-04-15 12:03:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:23,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {13308#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {13279#true} is VALID [2022-04-15 12:03:23,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {13279#true} assume true; {13279#true} is VALID [2022-04-15 12:03:23,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13279#true} {13279#true} #54#return; {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {13279#true} call ULTIMATE.init(); {13308#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:23,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {13308#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {13279#true} assume true; {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13279#true} {13279#true} #54#return; {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {13279#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {13279#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {13279#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {13279#true} is VALID [2022-04-15 12:03:23,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {13279#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {13284#(= main_~k~0 0)} is VALID [2022-04-15 12:03:23,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {13284#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13284#(= main_~k~0 0)} is VALID [2022-04-15 12:03:23,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {13284#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13285#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:23,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {13285#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13285#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:23,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {13285#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13286#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:23,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {13286#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13286#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:23,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {13286#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13287#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:23,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {13287#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13287#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:23,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {13287#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13288#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:23,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {13288#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13288#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:23,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {13288#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13289#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:23,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {13289#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13289#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:23,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {13289#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13290#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:23,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {13290#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13290#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:23,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {13290#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13291#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:23,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {13291#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13291#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:23,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {13291#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13292#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:23,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {13292#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13292#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:23,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {13292#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13293#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:23,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {13293#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13293#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:23,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {13293#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13294#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:23,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {13294#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13294#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:23,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {13294#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13295#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:23,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {13295#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13295#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:23,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {13295#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13296#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:23,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {13296#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13296#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:23,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {13296#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13297#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:23,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {13297#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13297#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:23,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {13297#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13298#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:23,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {13298#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13298#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:23,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {13298#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13299#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:23,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {13299#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13299#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:23,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {13299#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13300#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:23,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {13300#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13300#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:23,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {13300#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13301#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:23,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {13301#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13301#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:23,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {13301#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13302#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:23,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {13302#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13302#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:23,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {13302#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13303#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:23,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {13303#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13303#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:23,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {13303#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13304#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:23,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {13304#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13304#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:23,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {13304#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13305#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:23,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {13305#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13305#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:23,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {13305#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13306#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:03:23,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {13306#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13306#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {13306#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13307#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 23))} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {13307#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 23))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {13280#false} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {13280#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13280#false} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {13280#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {13280#false} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {13280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13280#false} is VALID [2022-04-15 12:03:23,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {13280#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {13280#false} is VALID [2022-04-15 12:03:23,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {13280#false} assume 0 != ~a~0 % 4294967296; {13280#false} is VALID [2022-04-15 12:03:23,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {13280#false} assume !false; {13280#false} is VALID [2022-04-15 12:03:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 2 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258304164] [2022-04-15 12:03:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258304164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135602297] [2022-04-15 12:03:23,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:03:23,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:23,168 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:23,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:03:23,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:03:23,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:23,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:03:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:23,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:23,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {13279#true} call ULTIMATE.init(); {13279#true} is VALID [2022-04-15 12:03:23,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {13279#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {13279#true} is VALID [2022-04-15 12:03:23,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {13279#true} assume true; {13279#true} is VALID [2022-04-15 12:03:23,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13279#true} {13279#true} #54#return; {13279#true} is VALID [2022-04-15 12:03:23,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {13279#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {13279#true} is VALID [2022-04-15 12:03:23,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {13279#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {13327#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {13327#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {13334#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:03:23,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {13334#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13334#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:03:23,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {13334#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13341#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 12:03:23,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {13341#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {13327#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {13327#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {13327#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {13327#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {13327#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {13327#(= main_~i~0 0)} is VALID [2022-04-15 12:03:23,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13486#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:23,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {13486#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {13280#false} is VALID [2022-04-15 12:03:23,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {13280#false} assume 0 != ~a~0 % 4294967296; {13280#false} is VALID [2022-04-15 12:03:23,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {13280#false} assume !false; {13280#false} is VALID [2022-04-15 12:03:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-04-15 12:03:23,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:23,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {13280#false} assume !false; {13280#false} is VALID [2022-04-15 12:03:23,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {13280#false} assume 0 != ~a~0 % 4294967296; {13280#false} is VALID [2022-04-15 12:03:23,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {13502#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {13280#false} is VALID [2022-04-15 12:03:23,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13502#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {13648#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {13652#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13648#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:23,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {13652#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {13652#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:23,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {13652#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:03:23,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {13279#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {13506#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:23,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {13279#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {13279#true} is VALID [2022-04-15 12:03:23,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13279#true} {13279#true} #54#return; {13279#true} is VALID [2022-04-15 12:03:23,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {13279#true} assume true; {13279#true} is VALID [2022-04-15 12:03:23,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {13279#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {13279#true} is VALID [2022-04-15 12:03:23,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {13279#true} call ULTIMATE.init(); {13279#true} is VALID [2022-04-15 12:03:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-04-15 12:03:23,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135602297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:23,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 6, 6] total 35 [2022-04-15 12:03:23,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:23,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [845745497] [2022-04-15 12:03:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [845745497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:23,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:03:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068264474] [2022-04-15 12:03:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:03:23,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:23,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:24,255 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 12:03:24,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:03:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:03:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:03:24,256 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:43,553 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-04-15 12:03:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:03:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:03:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-15 12:03:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-15 12:03:43,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 80 transitions. [2022-04-15 12:03:44,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:44,135 INFO L225 Difference]: With dead ends: 120 [2022-04-15 12:03:44,135 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 12:03:44,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:03:44,136 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:44,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-04-15 12:03:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 12:03:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-15 12:03:44,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:44,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:44,182 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:44,182 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:44,183 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-04-15 12:03:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-04-15 12:03:44,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:44,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:44,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 12:03:44,184 INFO L87 Difference]: Start difference. First operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 12:03:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:44,184 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-04-15 12:03:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-04-15 12:03:44,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:44,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:44,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:44,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2022-04-15 12:03:44,186 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2022-04-15 12:03:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:44,186 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2022-04-15 12:03:44,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:44,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 66 transitions. [2022-04-15 12:03:44,560 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 12:03:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-04-15 12:03:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:03:44,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:44,560 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:44,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:44,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:44,761 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash -676698069, now seen corresponding path program 47 times [2022-04-15 12:03:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245140785] [2022-04-15 12:03:46,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:46,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:46,659 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:46,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -676698069, now seen corresponding path program 48 times [2022-04-15 12:03:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:46,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904446810] [2022-04-15 12:03:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:47,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {14214#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {14184#true} is VALID [2022-04-15 12:03:47,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {14184#true} assume true; {14184#true} is VALID [2022-04-15 12:03:47,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14184#true} {14184#true} #54#return; {14184#true} is VALID [2022-04-15 12:03:47,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {14184#true} call ULTIMATE.init(); {14214#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {14214#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {14184#true} assume true; {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14184#true} {14184#true} #54#return; {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {14184#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {14184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {14184#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {14184#true} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {14184#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {14189#(= main_~k~0 0)} is VALID [2022-04-15 12:03:47,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {14189#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14189#(= main_~k~0 0)} is VALID [2022-04-15 12:03:47,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {14189#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14190#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:47,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {14190#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14190#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:03:47,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {14190#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14191#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:47,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {14191#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14191#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:03:47,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {14191#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14192#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:47,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {14192#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14192#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:03:47,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {14192#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14193#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:47,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {14193#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14193#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:03:47,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {14193#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14194#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:47,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {14194#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14194#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:03:47,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {14194#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14195#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:47,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {14195#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14195#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:03:47,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {14195#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14196#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:47,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {14196#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14196#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:03:47,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {14196#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14197#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:47,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {14197#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14197#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:03:47,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {14197#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14198#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:47,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {14198#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14198#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:03:47,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {14198#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14199#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:47,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {14199#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14199#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:03:47,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {14199#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14200#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:47,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {14200#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14200#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:03:47,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {14200#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14201#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:47,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {14201#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14201#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:03:47,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {14201#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14202#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:47,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {14202#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14202#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:03:47,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {14202#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14203#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:47,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {14203#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14203#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:03:47,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {14203#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14204#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:47,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {14204#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14204#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:03:47,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {14204#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14205#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:47,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {14205#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14205#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:03:47,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {14205#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14206#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:47,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {14206#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14206#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:03:47,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {14206#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14207#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:47,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {14207#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14207#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:03:47,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {14207#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14208#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:47,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {14208#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14208#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:03:47,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {14208#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14209#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:47,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {14209#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14209#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:03:47,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {14209#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14210#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:47,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {14210#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14210#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:03:47,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {14210#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14211#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:03:47,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {14211#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14211#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:03:47,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {14211#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14212#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:03:47,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {14212#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14212#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:03:47,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {14212#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14213#(and (<= main_~k~0 24) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {14213#(and (<= main_~k~0 24) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {14185#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {14185#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {14185#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {14185#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {14185#false} assume 0 != ~a~0 % 4294967296; {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {14185#false} assume !false; {14185#false} is VALID [2022-04-15 12:03:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 2 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904446810] [2022-04-15 12:03:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904446810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050264836] [2022-04-15 12:03:47,209 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:03:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:47,210 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:47,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:03:47,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:03:47,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:47,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:03:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:47,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:47,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {14184#true} call ULTIMATE.init(); {14184#true} is VALID [2022-04-15 12:03:47,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {14184#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {14184#true} is VALID [2022-04-15 12:03:47,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {14184#true} assume true; {14184#true} is VALID [2022-04-15 12:03:47,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14184#true} {14184#true} #54#return; {14184#true} is VALID [2022-04-15 12:03:47,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {14184#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {14184#true} is VALID [2022-04-15 12:03:47,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {14184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {14233#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {14233#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {14233#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {14233#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {14233#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {14233#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {14233#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {14233#(= main_~i~0 0)} is VALID [2022-04-15 12:03:47,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {14233#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14396#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:47,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {14396#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {14185#false} is VALID [2022-04-15 12:03:47,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {14185#false} assume 0 != ~a~0 % 4294967296; {14185#false} is VALID [2022-04-15 12:03:47,539 INFO L290 TraceCheckUtils]: 62: Hoare triple {14185#false} assume !false; {14185#false} is VALID [2022-04-15 12:03:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-04-15 12:03:47,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:47,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {14185#false} assume !false; {14185#false} is VALID [2022-04-15 12:03:47,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {14185#false} assume 0 != ~a~0 % 4294967296; {14185#false} is VALID [2022-04-15 12:03:47,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {14412#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {14185#false} is VALID [2022-04-15 12:03:47,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14412#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {14184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {14416#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:03:47,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {14184#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {14184#true} is VALID [2022-04-15 12:03:47,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14184#true} {14184#true} #54#return; {14184#true} is VALID [2022-04-15 12:03:47,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {14184#true} assume true; {14184#true} is VALID [2022-04-15 12:03:47,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14184#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {14184#true} is VALID [2022-04-15 12:03:47,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {14184#true} call ULTIMATE.init(); {14184#true} is VALID [2022-04-15 12:03:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-04-15 12:03:47,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050264836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:47,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:47,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4, 4] total 32 [2022-04-15 12:03:47,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:47,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245140785] [2022-04-15 12:03:47,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245140785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:47,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:47,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:03:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259985094] [2022-04-15 12:03:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:03:47,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:47,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:48,391 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 12:03:48,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:03:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:03:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:03:48,393 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:12,648 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-04-15 12:04:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:04:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:04:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:04:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-15 12:04:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-15 12:04:12,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 82 transitions. [2022-04-15 12:04:13,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:04:13,287 INFO L225 Difference]: With dead ends: 124 [2022-04-15 12:04:13,287 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:04:13,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:04:13,288 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:04:13,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-04-15 12:04:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:04:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-15 12:04:13,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:04:13,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:13,343 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:13,344 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:13,345 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 12:04:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 12:04:13,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:04:13,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:04:13,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 12:04:13,345 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 12:04:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:13,346 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 12:04:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 12:04:13,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:04:13,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:04:13,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:04:13,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:04:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2022-04-15 12:04:13,347 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2022-04-15 12:04:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:04:13,347 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2022-04-15 12:04:13,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:13,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 68 transitions. [2022-04-15 12:04:13,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:04:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-04-15 12:04:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:04:13,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:04:13,711 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:04:13,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:04:13,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 12:04:13,912 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:04:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:04:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1065277367, now seen corresponding path program 49 times [2022-04-15 12:04:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:13,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925344362] [2022-04-15 12:04:15,283 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:15,283 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:15,626 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:15,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:04:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1065277367, now seen corresponding path program 50 times [2022-04-15 12:04:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:04:15,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984175541] [2022-04-15 12:04:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:04:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:04:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:16,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:04:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:16,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {15145#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {15114#true} is VALID [2022-04-15 12:04:16,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {15114#true} assume true; {15114#true} is VALID [2022-04-15 12:04:16,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15114#true} {15114#true} #54#return; {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {15114#true} call ULTIMATE.init(); {15145#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:04:16,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {15145#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {15114#true} assume true; {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15114#true} {15114#true} #54#return; {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {15114#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {15114#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {15114#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {15114#true} is VALID [2022-04-15 12:04:16,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {15114#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {15119#(= main_~k~0 0)} is VALID [2022-04-15 12:04:16,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {15119#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15119#(= main_~k~0 0)} is VALID [2022-04-15 12:04:16,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {15119#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15120#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:04:16,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {15120#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15120#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:04:16,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {15120#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15121#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:04:16,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {15121#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15121#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:04:16,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {15121#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15122#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:04:16,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {15122#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15122#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:04:16,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {15122#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15123#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:04:16,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {15123#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15123#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:04:16,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {15123#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15124#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:04:16,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {15124#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15124#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:04:16,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {15124#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15125#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:04:16,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {15125#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15125#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:04:16,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {15125#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15126#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:04:16,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15126#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:04:16,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15127#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:04:16,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {15127#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15127#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:04:16,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {15127#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15128#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:04:16,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {15128#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15128#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:04:16,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {15128#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15129#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:04:16,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {15129#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15129#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:04:16,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {15129#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15130#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:04:16,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {15130#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15130#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:04:16,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {15130#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15131#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:04:16,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {15131#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15131#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:04:16,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {15131#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15132#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:04:16,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {15132#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15132#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:04:16,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {15132#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15133#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:04:16,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {15133#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15133#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:04:16,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {15133#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15134#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:04:16,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {15134#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15134#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:04:16,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {15134#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15135#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:04:16,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {15135#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15135#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:04:16,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {15135#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15136#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:04:16,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {15136#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15136#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:04:16,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {15136#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15137#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:04:16,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {15137#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15137#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:04:16,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {15137#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15138#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:04:16,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {15138#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15138#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:04:16,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {15138#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15139#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:04:16,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {15139#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15139#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:04:16,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {15139#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15140#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:04:16,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {15140#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15140#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:04:16,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {15140#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15141#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:04:16,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {15141#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15141#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:04:16,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {15141#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15142#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:04:16,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {15142#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15142#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:04:16,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {15142#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15143#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:04:16,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {15143#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15143#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:04:16,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {15143#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15144#(and (<= main_~k~0 25) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {15144#(and (<= main_~k~0 25) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 59: Hoare triple {15115#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {15115#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {15115#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {15115#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#false} assume 0 != ~a~0 % 4294967296; {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#false} assume !false; {15115#false} is VALID [2022-04-15 12:04:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 2 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:04:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:04:16,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984175541] [2022-04-15 12:04:16,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984175541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:04:16,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936626783] [2022-04-15 12:04:16,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:04:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:04:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:04:16,175 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:04:16,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:04:16,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:04:16,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:04:16,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:04:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:16,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:04:16,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {15114#true} call ULTIMATE.init(); {15114#true} is VALID [2022-04-15 12:04:16,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {15114#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {15114#true} is VALID [2022-04-15 12:04:16,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {15114#true} assume true; {15114#true} is VALID [2022-04-15 12:04:16,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15114#true} {15114#true} #54#return; {15114#true} is VALID [2022-04-15 12:04:16,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {15114#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {15114#true} is VALID [2022-04-15 12:04:16,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {15114#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {15164#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {15164#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {15171#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:16,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {15171#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15171#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:16,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {15171#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15178#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:16,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {15178#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {15164#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {15164#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {15164#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {15164#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {15164#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {15164#(= main_~i~0 0)} is VALID [2022-04-15 12:04:16,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {15164#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15335#(= main_~i~0 1)} is VALID [2022-04-15 12:04:16,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {15335#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {15115#false} is VALID [2022-04-15 12:04:16,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#false} assume 0 != ~a~0 % 4294967296; {15115#false} is VALID [2022-04-15 12:04:16,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#false} assume !false; {15115#false} is VALID [2022-04-15 12:04:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-04-15 12:04:16,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:04:17,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#false} assume !false; {15115#false} is VALID [2022-04-15 12:04:17,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#false} assume 0 != ~a~0 % 4294967296; {15115#false} is VALID [2022-04-15 12:04:17,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {15351#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {15115#false} is VALID [2022-04-15 12:04:17,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15351#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {15509#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {15513#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15509#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:17,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {15513#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {15513#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:17,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {15513#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:17,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {15114#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {15355#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:17,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {15114#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {15114#true} is VALID [2022-04-15 12:04:17,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15114#true} {15114#true} #54#return; {15114#true} is VALID [2022-04-15 12:04:17,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {15114#true} assume true; {15114#true} is VALID [2022-04-15 12:04:17,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {15114#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {15114#true} is VALID [2022-04-15 12:04:17,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {15114#true} call ULTIMATE.init(); {15114#true} is VALID [2022-04-15 12:04:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 72 proven. 2 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-04-15 12:04:17,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936626783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:04:17,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:04:17,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 6, 6] total 37 [2022-04-15 12:04:17,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:04:17,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1925344362] [2022-04-15 12:04:17,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1925344362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:04:17,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:04:17,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:04:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852010424] [2022-04-15 12:04:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:04:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:04:17,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:04:17,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:17,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:04:17,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:04:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:04:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:04:17,467 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:46,613 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-04-15 12:04:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:04:46,613 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:04:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:04:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2022-04-15 12:04:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2022-04-15 12:04:46,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 84 transitions. [2022-04-15 12:04:47,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:04:47,383 INFO L225 Difference]: With dead ends: 128 [2022-04-15 12:04:47,383 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 12:04:47,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:04:47,384 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:04:47,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 186 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-04-15 12:04:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 12:04:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-15 12:04:47,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:04:47,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:47,433 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:47,434 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:47,440 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-15 12:04:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-04-15 12:04:47,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:04:47,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:04:47,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 12:04:47,440 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 12:04:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:04:47,441 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-15 12:04:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-04-15 12:04:47,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:04:47,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:04:47,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:04:47,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:04:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-15 12:04:47,442 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2022-04-15 12:04:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:04:47,443 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-15 12:04:47,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:47,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-15 12:04:47,919 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 12:04:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 12:04:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:04:47,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:04:47,919 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:04:47,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:04:48,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:04:48,120 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:04:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:04:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash -827827993, now seen corresponding path program 51 times [2022-04-15 12:04:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003012117] [2022-04-15 12:04:49,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:49,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:50,390 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:04:50,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:04:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -827827993, now seen corresponding path program 52 times [2022-04-15 12:04:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:04:50,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469490240] [2022-04-15 12:04:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:04:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:04:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:04:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:50,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {16109#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {16077#true} is VALID [2022-04-15 12:04:50,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {16077#true} assume true; {16077#true} is VALID [2022-04-15 12:04:50,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16077#true} {16077#true} #54#return; {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {16077#true} call ULTIMATE.init(); {16109#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:04:50,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {16109#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {16077#true} assume true; {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16077#true} {16077#true} #54#return; {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {16077#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {16077#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {16077#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {16077#true} is VALID [2022-04-15 12:04:50,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {16077#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {16082#(= main_~k~0 0)} is VALID [2022-04-15 12:04:50,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {16082#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16082#(= main_~k~0 0)} is VALID [2022-04-15 12:04:50,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {16082#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16083#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:04:50,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {16083#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16083#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:04:50,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {16083#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16084#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:04:50,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {16084#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16084#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:04:50,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16085#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:04:50,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {16085#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16085#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:04:50,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {16085#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16086#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:04:50,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {16086#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16086#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:04:50,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {16086#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16087#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:04:50,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {16087#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16087#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:04:50,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {16087#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16088#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:04:50,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {16088#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16088#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:04:50,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {16088#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16089#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:04:50,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {16089#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16089#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:04:50,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {16089#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16090#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:04:50,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {16090#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16090#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:04:50,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {16090#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16091#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:04:50,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {16091#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16091#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:04:50,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {16091#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16092#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:04:50,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {16092#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16092#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:04:50,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {16092#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16093#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:04:50,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {16093#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16093#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:04:50,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {16093#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16094#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:04:50,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {16094#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16094#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:04:50,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {16094#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16095#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:04:50,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {16095#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16095#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:04:50,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {16095#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16096#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:04:50,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {16096#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16096#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:04:50,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {16096#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16097#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:04:50,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {16097#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16097#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:04:50,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {16097#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16098#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:04:50,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {16098#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16098#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:04:50,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {16098#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16099#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:04:50,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {16099#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16099#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:04:50,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {16099#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16100#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:04:50,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {16100#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16100#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:04:50,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {16100#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16101#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:04:50,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {16101#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16101#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:04:50,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {16101#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16102#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:04:50,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {16102#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16102#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:04:50,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {16102#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16103#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:04:50,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {16103#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16103#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:04:50,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {16103#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16104#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:04:50,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {16104#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16104#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:04:50,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {16104#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16105#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:04:50,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {16105#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16105#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:04:50,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {16105#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16106#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:04:50,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {16106#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16106#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:04:50,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {16106#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16107#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:04:50,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {16107#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16107#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:04:50,999 INFO L290 TraceCheckUtils]: 59: Hoare triple {16107#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16108#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 26))} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {16108#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 26))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {16078#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {16078#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {16078#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {16078#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {16078#false} assume 0 != ~a~0 % 4294967296; {16078#false} is VALID [2022-04-15 12:04:51,000 INFO L290 TraceCheckUtils]: 66: Hoare triple {16078#false} assume !false; {16078#false} is VALID [2022-04-15 12:04:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 2 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:04:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:04:51,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469490240] [2022-04-15 12:04:51,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469490240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:04:51,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881459802] [2022-04-15 12:04:51,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:04:51,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:04:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:04:51,002 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:04:51,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:04:51,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:04:51,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:04:51,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:04:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:51,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:04:51,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {16077#true} call ULTIMATE.init(); {16077#true} is VALID [2022-04-15 12:04:51,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {16077#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {16077#true} is VALID [2022-04-15 12:04:51,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {16077#true} assume true; {16077#true} is VALID [2022-04-15 12:04:51,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16077#true} {16077#true} #54#return; {16077#true} is VALID [2022-04-15 12:04:51,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {16077#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {16077#true} is VALID [2022-04-15 12:04:51,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {16077#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {16128#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {16128#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {16135#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:51,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {16135#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16135#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:51,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {16135#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16142#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:04:51,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {16142#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {16128#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {16128#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {16128#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {16128#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {16128#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {16128#(= main_~i~0 0)} is VALID [2022-04-15 12:04:51,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {16128#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16305#(= main_~i~0 1)} is VALID [2022-04-15 12:04:51,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {16305#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {16078#false} is VALID [2022-04-15 12:04:51,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {16078#false} assume 0 != ~a~0 % 4294967296; {16078#false} is VALID [2022-04-15 12:04:51,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {16078#false} assume !false; {16078#false} is VALID [2022-04-15 12:04:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-04-15 12:04:51,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:04:51,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {16078#false} assume !false; {16078#false} is VALID [2022-04-15 12:04:51,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {16078#false} assume 0 != ~a~0 % 4294967296; {16078#false} is VALID [2022-04-15 12:04:51,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {16321#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {16078#false} is VALID [2022-04-15 12:04:51,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16321#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {16485#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {16489#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16485#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:51,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {16489#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {16489#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:51,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {16489#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:04:51,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {16077#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {16325#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:04:51,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {16077#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {16077#true} is VALID [2022-04-15 12:04:51,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16077#true} {16077#true} #54#return; {16077#true} is VALID [2022-04-15 12:04:51,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {16077#true} assume true; {16077#true} is VALID [2022-04-15 12:04:51,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {16077#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {16077#true} is VALID [2022-04-15 12:04:51,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {16077#true} call ULTIMATE.init(); {16077#true} is VALID [2022-04-15 12:04:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 75 proven. 2 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-04-15 12:04:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881459802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:04:51,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:04:51,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6, 6] total 38 [2022-04-15 12:04:51,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:04:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003012117] [2022-04-15 12:04:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003012117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:04:51,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:04:51,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:04:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425270702] [2022-04-15 12:04:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:04:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:04:51,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:04:51,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:04:52,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:04:52,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:04:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:52,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:04:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:04:52,670 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:33,837 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2022-04-15 12:05:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:05:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:05:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 86 transitions. [2022-04-15 12:05:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 86 transitions. [2022-04-15 12:05:33,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 86 transitions. [2022-04-15 12:05:34,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:05:34,653 INFO L225 Difference]: With dead ends: 132 [2022-04-15 12:05:34,653 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 12:05:34,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:05:34,654 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:34,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2022-04-15 12:05:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 12:05:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-15 12:05:34,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:34,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:34,705 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:34,705 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:34,708 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-04-15 12:05:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-04-15 12:05:34,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:34,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:34,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:05:34,709 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:05:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:34,709 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-04-15 12:05:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-04-15 12:05:34,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:34,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:34,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:34,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-04-15 12:05:34,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2022-04-15 12:05:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:34,710 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-04-15 12:05:34,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:34,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 72 transitions. [2022-04-15 12:05:35,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:05:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-04-15 12:05:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:05:35,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:35,277 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:35,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:05:35,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:35,494 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -272246267, now seen corresponding path program 53 times [2022-04-15 12:05:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976596380] [2022-04-15 12:05:36,601 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:36,602 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:38,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:38,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -272246267, now seen corresponding path program 54 times [2022-04-15 12:05:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:38,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977409158] [2022-04-15 12:05:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:38,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {17102#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {17069#true} is VALID [2022-04-15 12:05:38,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {17069#true} assume true; {17069#true} is VALID [2022-04-15 12:05:38,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17069#true} {17069#true} #54#return; {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {17069#true} call ULTIMATE.init(); {17102#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:05:38,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {17102#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {17069#true} assume true; {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17069#true} {17069#true} #54#return; {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {17069#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {17069#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {17069#true} is VALID [2022-04-15 12:05:38,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {17069#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {17069#true} is VALID [2022-04-15 12:05:38,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {17069#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {17074#(= main_~k~0 0)} is VALID [2022-04-15 12:05:38,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {17074#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17074#(= main_~k~0 0)} is VALID [2022-04-15 12:05:38,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {17074#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17075#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:05:38,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {17075#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17075#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:05:38,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {17075#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17076#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:05:38,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {17076#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17076#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:05:38,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {17076#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17077#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:05:38,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {17077#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17077#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:05:38,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {17077#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17078#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:05:38,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {17078#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17078#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:05:38,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {17078#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17079#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:05:38,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {17079#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17079#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:05:38,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {17079#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17080#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:05:38,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {17080#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17080#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:05:38,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {17080#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17081#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:05:38,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {17081#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17081#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:05:38,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {17081#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17082#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:05:38,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {17082#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17082#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:05:38,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {17082#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17083#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:05:38,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {17083#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17083#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:05:38,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {17083#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17084#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:05:38,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {17084#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17084#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:05:38,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {17084#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17085#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:05:38,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {17085#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17085#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:05:38,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {17085#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17086#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:05:38,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {17086#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17086#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:05:38,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {17086#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17087#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:05:38,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {17087#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17087#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:05:38,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {17087#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17088#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:05:38,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {17088#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17088#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:05:38,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {17088#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17089#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:05:38,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {17089#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17089#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:05:38,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {17089#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17090#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:05:38,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {17090#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17090#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:05:38,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {17090#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17091#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:05:38,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {17091#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17091#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:05:38,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {17091#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17092#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:05:38,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {17092#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17092#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:05:38,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {17092#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17093#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:05:38,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {17093#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17093#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:05:38,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {17093#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17094#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:05:38,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {17094#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17094#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:05:38,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {17094#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17095#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:05:38,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {17095#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17095#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:05:38,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {17095#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17096#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:05:38,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {17096#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17096#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:05:38,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {17096#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17097#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:05:38,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {17097#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17097#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:05:38,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {17097#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17098#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:05:38,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {17098#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17098#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:05:38,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {17098#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17099#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:05:38,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {17099#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17099#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:05:38,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {17099#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17100#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:05:38,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {17100#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17100#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:05:38,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {17100#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17101#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 27))} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {17101#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 27))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {17070#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {17070#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {17070#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {17070#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {17070#false} assume 0 != ~a~0 % 4294967296; {17070#false} is VALID [2022-04-15 12:05:38,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {17070#false} assume !false; {17070#false} is VALID [2022-04-15 12:05:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 2 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:05:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:38,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977409158] [2022-04-15 12:05:38,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977409158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:38,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249342683] [2022-04-15 12:05:38,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:05:38,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:38,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:38,794 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:05:38,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:05:38,923 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:05:38,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:38,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:05:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:38,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:39,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {17069#true} call ULTIMATE.init(); {17069#true} is VALID [2022-04-15 12:05:39,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {17069#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {17069#true} is VALID [2022-04-15 12:05:39,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {17069#true} assume true; {17069#true} is VALID [2022-04-15 12:05:39,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17069#true} {17069#true} #54#return; {17069#true} is VALID [2022-04-15 12:05:39,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {17069#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {17069#true} is VALID [2022-04-15 12:05:39,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {17069#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {17121#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {17121#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,154 INFO L290 TraceCheckUtils]: 57: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,154 INFO L290 TraceCheckUtils]: 58: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,154 INFO L290 TraceCheckUtils]: 59: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {17121#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {17121#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {17121#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {17121#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {17121#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {17121#(= main_~i~0 0)} is VALID [2022-04-15 12:05:39,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {17121#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17302#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:05:39,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {17302#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {17070#false} is VALID [2022-04-15 12:05:39,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {17070#false} assume 0 != ~a~0 % 4294967296; {17070#false} is VALID [2022-04-15 12:05:39,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {17070#false} assume !false; {17070#false} is VALID [2022-04-15 12:05:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2022-04-15 12:05:39,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:39,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {17070#false} assume !false; {17070#false} is VALID [2022-04-15 12:05:39,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {17070#false} assume 0 != ~a~0 % 4294967296; {17070#false} is VALID [2022-04-15 12:05:39,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {17318#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {17070#false} is VALID [2022-04-15 12:05:39,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17318#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {17069#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {17322#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:05:39,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {17069#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {17069#true} is VALID [2022-04-15 12:05:39,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17069#true} {17069#true} #54#return; {17069#true} is VALID [2022-04-15 12:05:39,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {17069#true} assume true; {17069#true} is VALID [2022-04-15 12:05:39,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {17069#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {17069#true} is VALID [2022-04-15 12:05:39,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {17069#true} call ULTIMATE.init(); {17069#true} is VALID [2022-04-15 12:05:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2022-04-15 12:05:39,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249342683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:39,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:39,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4, 4] total 35 [2022-04-15 12:05:39,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:39,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976596380] [2022-04-15 12:05:39,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976596380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:39,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:05:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378280908] [2022-04-15 12:05:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:05:39,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:39,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:05:40,381 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 12:05:40,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:05:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:05:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:05:40,382 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:26,501 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-04-15 12:06:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:06:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:06:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 88 transitions. [2022-04-15 12:06:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 88 transitions. [2022-04-15 12:06:26,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 88 transitions. [2022-04-15 12:06:27,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:06:27,400 INFO L225 Difference]: With dead ends: 136 [2022-04-15 12:06:27,400 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 12:06:27,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=1157, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:06:27,401 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:06:27,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 206 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2022-04-15 12:06:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 12:06:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-04-15 12:06:27,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:27,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:27,456 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:27,457 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2022-04-15 12:06:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-04-15 12:06:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:27,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:27,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:06:27,458 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:06:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:27,458 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2022-04-15 12:06:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-04-15 12:06:27,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:27,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:27,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:27,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2022-04-15 12:06:27,459 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2022-04-15 12:06:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:27,459 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2022-04-15 12:06:27,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:27,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 74 transitions. [2022-04-15 12:06:27,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:06:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-04-15 12:06:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:06:27,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:27,924 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:27,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:06:28,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:28,132 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1065847715, now seen corresponding path program 55 times [2022-04-15 12:06:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:28,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720486871] [2022-04-15 12:06:29,208 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:29,208 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:29,950 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:29,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1065847715, now seen corresponding path program 56 times [2022-04-15 12:06:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:29,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231772881] [2022-04-15 12:06:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:30,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {18120#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {18086#true} is VALID [2022-04-15 12:06:30,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {18086#true} assume true; {18086#true} is VALID [2022-04-15 12:06:30,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18086#true} {18086#true} #54#return; {18086#true} is VALID [2022-04-15 12:06:30,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {18086#true} call ULTIMATE.init(); {18120#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:06:30,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {18120#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {18086#true} assume true; {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18086#true} {18086#true} #54#return; {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {18086#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {18086#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {18086#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {18086#true} is VALID [2022-04-15 12:06:30,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {18086#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {18091#(= main_~k~0 0)} is VALID [2022-04-15 12:06:30,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18091#(= main_~k~0 0)} is VALID [2022-04-15 12:06:30,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18092#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:06:30,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {18092#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18092#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:06:30,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {18092#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18093#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:06:30,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {18093#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18093#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:06:30,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {18093#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18094#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:06:30,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {18094#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18094#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:06:30,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {18094#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18095#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:06:30,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {18095#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18095#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:06:30,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {18095#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18096#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:06:30,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {18096#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18096#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:06:30,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {18096#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18097#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:06:30,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {18097#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18097#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:06:30,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {18097#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18098#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:06:30,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {18098#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18098#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:06:30,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {18098#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18099#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:06:30,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {18099#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18099#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:06:30,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {18099#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18100#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:06:30,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {18100#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18100#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:06:30,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {18100#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18101#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:06:30,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {18101#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18101#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:06:30,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {18101#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18102#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:06:30,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {18102#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18102#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:06:30,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {18102#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18103#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:06:30,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {18103#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18103#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:06:30,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {18103#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18104#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:06:30,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {18104#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18104#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:06:30,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {18104#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18105#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:06:30,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {18105#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18105#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:06:30,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {18105#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18106#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:06:30,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {18106#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18106#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:06:30,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {18106#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18107#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:06:30,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {18107#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18107#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:06:30,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {18107#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18108#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:06:30,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {18108#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18108#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:06:30,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {18108#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18109#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:06:30,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {18109#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18109#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:06:30,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {18109#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18110#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:06:30,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {18110#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18110#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:06:30,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {18110#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18111#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:06:30,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {18111#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18111#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:06:30,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {18111#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18112#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:06:30,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {18112#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18112#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:06:30,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {18112#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18113#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:06:30,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {18113#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18113#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:06:30,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {18113#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18114#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:06:30,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {18114#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18114#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:06:30,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {18114#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18115#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:06:30,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {18115#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18115#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:06:30,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {18115#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18116#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:06:30,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {18116#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18116#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:06:30,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {18116#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18117#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:06:30,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {18117#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18117#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:06:30,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {18117#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18118#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:06:30,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {18118#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18118#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {18118#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18119#(and (<= main_~k~0 28) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {18119#(and (<= main_~k~0 28) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {18087#false} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {18087#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {18087#false} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {18087#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {18087#false} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {18087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18087#false} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {18087#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {18087#false} is VALID [2022-04-15 12:06:30,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {18087#false} assume 0 != ~a~0 % 4294967296; {18087#false} is VALID [2022-04-15 12:06:30,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {18087#false} assume !false; {18087#false} is VALID [2022-04-15 12:06:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 2 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:06:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:30,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231772881] [2022-04-15 12:06:30,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231772881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:30,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706624382] [2022-04-15 12:06:30,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:06:30,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:30,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:30,585 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:06:30,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:06:30,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:06:30,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:30,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:06:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:30,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:30,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {18086#true} call ULTIMATE.init(); {18086#true} is VALID [2022-04-15 12:06:30,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {18086#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {18086#true} is VALID [2022-04-15 12:06:30,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {18086#true} assume true; {18086#true} is VALID [2022-04-15 12:06:30,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18086#true} {18086#true} #54#return; {18086#true} is VALID [2022-04-15 12:06:30,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {18086#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {18086#true} is VALID [2022-04-15 12:06:30,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {18086#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {18139#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {18139#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {18146#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:06:30,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {18146#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18146#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:06:30,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {18146#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18153#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:06:30,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {18153#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,998 INFO L290 TraceCheckUtils]: 61: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,999 INFO L290 TraceCheckUtils]: 62: Hoare triple {18139#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {18139#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,999 INFO L290 TraceCheckUtils]: 64: Hoare triple {18139#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:30,999 INFO L290 TraceCheckUtils]: 65: Hoare triple {18139#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:31,000 INFO L290 TraceCheckUtils]: 66: Hoare triple {18139#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {18139#(= main_~i~0 0)} is VALID [2022-04-15 12:06:31,000 INFO L290 TraceCheckUtils]: 67: Hoare triple {18139#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18328#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:06:31,000 INFO L290 TraceCheckUtils]: 68: Hoare triple {18328#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {18087#false} is VALID [2022-04-15 12:06:31,000 INFO L290 TraceCheckUtils]: 69: Hoare triple {18087#false} assume 0 != ~a~0 % 4294967296; {18087#false} is VALID [2022-04-15 12:06:31,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {18087#false} assume !false; {18087#false} is VALID [2022-04-15 12:06:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-04-15 12:06:31,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:31,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {18087#false} assume !false; {18087#false} is VALID [2022-04-15 12:06:31,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {18087#false} assume 0 != ~a~0 % 4294967296; {18087#false} is VALID [2022-04-15 12:06:31,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {18344#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {18087#false} is VALID [2022-04-15 12:06:31,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18344#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {18520#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {18524#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18520#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:06:31,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {18524#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {18524#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:06:31,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {18524#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:06:31,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {18086#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {18348#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:06:31,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {18086#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {18086#true} is VALID [2022-04-15 12:06:31,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18086#true} {18086#true} #54#return; {18086#true} is VALID [2022-04-15 12:06:31,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {18086#true} assume true; {18086#true} is VALID [2022-04-15 12:06:31,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {18086#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {18086#true} is VALID [2022-04-15 12:06:31,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {18086#true} call ULTIMATE.init(); {18086#true} is VALID [2022-04-15 12:06:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-04-15 12:06:31,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706624382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:31,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 6, 6] total 40 [2022-04-15 12:06:31,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:31,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720486871] [2022-04-15 12:06:31,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720486871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:31,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:06:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384323374] [2022-04-15 12:06:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:06:31,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:31,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:06:32,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:06:32,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:06:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:06:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:06:32,529 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:29,434 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-15 12:07:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:07:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:07:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:07:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 90 transitions. [2022-04-15 12:07:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 90 transitions. [2022-04-15 12:07:29,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 90 transitions. [2022-04-15 12:07:30,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:07:30,568 INFO L225 Difference]: With dead ends: 140 [2022-04-15 12:07:30,568 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 12:07:30,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:07:30,569 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:07:30,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 246 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 22.1s Time] [2022-04-15 12:07:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 12:07:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-15 12:07:30,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:30,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:30,625 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:30,625 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:30,626 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 12:07:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 12:07:30,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:30,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:30,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 12:07:30,627 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 12:07:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:30,627 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 12:07:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 12:07:30,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:30,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:30,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:30,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-04-15 12:07:30,628 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2022-04-15 12:07:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:30,628 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-04-15 12:07:30,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:30,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 76 transitions. [2022-04-15 12:07:31,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:07:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-04-15 12:07:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:07:31,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:31,321 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:07:31,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:07:31,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:31,522 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1516024383, now seen corresponding path program 57 times [2022-04-15 12:07:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044442083] [2022-04-15 12:07:33,809 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:33,809 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:34,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:34,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1516024383, now seen corresponding path program 58 times [2022-04-15 12:07:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:34,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109694033] [2022-04-15 12:07:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:35,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:35,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {19171#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {19136#true} is VALID [2022-04-15 12:07:35,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {19136#true} assume true; {19136#true} is VALID [2022-04-15 12:07:35,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19136#true} {19136#true} #54#return; {19136#true} is VALID [2022-04-15 12:07:35,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {19136#true} call ULTIMATE.init(); {19171#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {19171#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {19136#true} assume true; {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19136#true} {19136#true} #54#return; {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {19136#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {19136#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {19136#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {19136#true} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {19136#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {19141#(= main_~k~0 0)} is VALID [2022-04-15 12:07:35,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {19141#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19141#(= main_~k~0 0)} is VALID [2022-04-15 12:07:35,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {19141#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19142#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:07:35,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {19142#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19142#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:07:35,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {19142#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19143#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:07:35,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {19143#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19143#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:07:35,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {19143#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19144#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:07:35,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {19144#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19144#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:07:35,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {19144#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19145#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:07:35,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {19145#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19145#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:07:35,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {19145#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19146#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:07:35,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {19146#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19146#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:07:35,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {19146#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19147#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:07:35,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {19147#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19147#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:07:35,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {19147#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19148#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:07:35,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {19148#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19148#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:07:35,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {19148#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19149#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:07:35,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {19149#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19149#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:07:35,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {19149#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19150#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:07:35,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {19150#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19150#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:07:35,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {19150#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19151#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:07:35,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {19151#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19151#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:07:35,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {19151#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19152#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:07:35,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {19152#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19152#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:07:35,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {19152#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19153#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:07:35,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {19153#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19153#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:07:35,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {19153#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19154#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:07:35,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {19154#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19154#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:07:35,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {19154#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19155#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:07:35,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {19155#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19155#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:07:35,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {19155#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19156#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:07:35,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {19156#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19156#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:07:35,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {19156#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19157#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:07:35,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {19157#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19157#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:07:35,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {19157#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19158#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:07:35,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {19158#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19158#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:07:35,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {19158#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19159#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:07:35,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {19159#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19159#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:07:35,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {19159#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19160#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:07:35,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {19160#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19160#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:07:35,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {19160#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19161#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:07:35,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {19161#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19161#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:07:35,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {19161#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19162#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:07:35,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {19162#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19162#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:07:35,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {19162#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19163#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:07:35,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {19163#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19163#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:07:35,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {19163#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19164#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:07:35,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {19164#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19164#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:07:35,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {19164#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19165#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:07:35,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {19165#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19165#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:07:35,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {19165#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19166#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:07:35,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {19166#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19166#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:07:35,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {19166#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19167#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:07:35,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {19167#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19167#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:07:35,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {19167#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19168#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:07:35,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {19168#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19168#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:07:35,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {19168#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19169#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:07:35,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {19169#(and (<= main_~k~0 28) (<= 28 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19169#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:07:35,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {19169#(and (<= main_~k~0 28) (<= 28 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19170#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 29))} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {19170#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 29))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {19137#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {19137#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {19137#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {19137#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {19137#false} assume 0 != ~a~0 % 4294967296; {19137#false} is VALID [2022-04-15 12:07:35,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {19137#false} assume !false; {19137#false} is VALID [2022-04-15 12:07:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 2 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:07:35,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:35,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109694033] [2022-04-15 12:07:35,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109694033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:35,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562988489] [2022-04-15 12:07:35,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:07:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:35,412 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:07:35,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:07:35,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:07:35,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:35,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:07:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:35,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:35,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {19136#true} call ULTIMATE.init(); {19136#true} is VALID [2022-04-15 12:07:35,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {19136#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {19136#true} is VALID [2022-04-15 12:07:35,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {19136#true} assume true; {19136#true} is VALID [2022-04-15 12:07:35,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19136#true} {19136#true} #54#return; {19136#true} is VALID [2022-04-15 12:07:35,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {19136#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {19136#true} is VALID [2022-04-15 12:07:35,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {19136#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {19136#true} is VALID [2022-04-15 12:07:35,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {19136#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {19193#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {19197#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-15 12:07:35,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {19197#(and (= main_~k~0 0) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19197#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-15 12:07:35,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {19197#(and (= main_~k~0 0) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19204#(and (= main_~j~0 0) (= main_~k~0 1))} is VALID [2022-04-15 12:07:35,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {19204#(and (= main_~j~0 0) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,840 INFO L290 TraceCheckUtils]: 64: Hoare triple {19193#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {19193#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {19193#(= main_~j~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {19193#(= main_~j~0 0)} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {19193#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {19379#(= main_~j~0 1)} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {19379#(= main_~j~0 1)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {19137#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19137#false} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {19137#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {19137#false} assume 0 != ~a~0 % 4294967296; {19137#false} is VALID [2022-04-15 12:07:35,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {19137#false} assume !false; {19137#false} is VALID [2022-04-15 12:07:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 1 proven. 86 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2022-04-15 12:07:35,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:36,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {19137#false} assume !false; {19137#false} is VALID [2022-04-15 12:07:36,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {19137#false} assume 0 != ~a~0 % 4294967296; {19137#false} is VALID [2022-04-15 12:07:36,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {19137#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:36,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {19137#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19137#false} is VALID [2022-04-15 12:07:36,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {19407#(< (mod main_~j~0 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {19137#false} is VALID [2022-04-15 12:07:36,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {19407#(< (mod main_~j~0 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {19583#(or (< (mod (+ main_~j~0 1) 4294967296) 1048576) (not (< (mod main_~k~0 4294967296) 1048576)))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {19587#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~j~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19583#(or (< (mod (+ main_~j~0 1) 4294967296) 1048576) (not (< (mod main_~k~0 4294967296) 1048576)))} is VALID [2022-04-15 12:07:36,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {19587#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~j~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {19587#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~j~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:07:36,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {19587#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~j~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:07:36,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {19136#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {19411#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:07:36,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {19136#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {19136#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19136#true} {19136#true} #54#return; {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {19136#true} assume true; {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {19136#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {19136#true} call ULTIMATE.init(); {19136#true} is VALID [2022-04-15 12:07:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2022-04-15 12:07:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562988489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:36,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 6, 6] total 41 [2022-04-15 12:07:36,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:36,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044442083] [2022-04-15 12:07:36,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044442083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:36,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:36,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:07:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269404033] [2022-04-15 12:07:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:07:36,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:36,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:07:37,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:07:37,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:07:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:07:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:07:37,410 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:45,759 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-15 12:08:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:08:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:08:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:08:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 92 transitions. [2022-04-15 12:08:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 92 transitions. [2022-04-15 12:08:45,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 92 transitions. [2022-04-15 12:08:47,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:08:47,117 INFO L225 Difference]: With dead ends: 144 [2022-04-15 12:08:47,117 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 12:08:47,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:08:47,118 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:08:47,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 26.2s Time] [2022-04-15 12:08:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 12:08:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-15 12:08:47,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:08:47,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:47,181 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:47,181 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:47,182 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 12:08:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 12:08:47,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:47,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:47,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 12:08:47,183 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 12:08:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:47,183 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 12:08:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 12:08:47,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:47,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:47,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:08:47,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:08:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-15 12:08:47,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2022-04-15 12:08:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:08:47,184 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-15 12:08:47,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:47,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-15 12:08:48,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:08:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 12:08:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:08:48,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:08:48,027 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:08:48,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 12:08:48,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:08:48,227 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:08:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:08:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -204013473, now seen corresponding path program 59 times [2022-04-15 12:08:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:48,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522327727] [2022-04-15 12:08:49,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:49,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:51,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:51,196 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:08:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -204013473, now seen corresponding path program 60 times [2022-04-15 12:08:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:08:51,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823466857] [2022-04-15 12:08:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:08:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:08:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:08:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:51,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {20251#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {20215#true} assume true; {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20215#true} {20215#true} #54#return; {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {20215#true} call ULTIMATE.init(); {20251#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:08:51,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {20215#true} assume true; {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20215#true} {20215#true} #54#return; {20215#true} is VALID [2022-04-15 12:08:51,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {20215#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {20215#true} is VALID [2022-04-15 12:08:51,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {20215#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {20215#true} is VALID [2022-04-15 12:08:51,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {20215#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {20215#true} is VALID [2022-04-15 12:08:51,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {20215#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {20220#(= main_~k~0 0)} is VALID [2022-04-15 12:08:51,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {20220#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20220#(= main_~k~0 0)} is VALID [2022-04-15 12:08:51,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {20220#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20221#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:08:51,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {20221#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20221#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:08:51,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {20221#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20222#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:08:51,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {20222#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20222#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:08:51,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {20222#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20223#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:08:51,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {20223#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20223#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:08:51,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {20223#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20224#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:08:51,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {20224#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20224#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:08:51,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {20224#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20225#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:08:51,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {20225#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20225#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:08:51,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {20225#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20226#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:08:51,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {20226#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20226#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:08:51,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {20226#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20227#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:08:51,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {20227#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20227#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:08:51,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {20227#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20228#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:08:51,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {20228#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20228#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:08:51,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {20228#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20229#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:08:51,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {20229#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20229#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:08:51,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {20229#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20230#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:08:51,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {20230#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20230#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:08:51,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {20230#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20231#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:08:51,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {20231#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20231#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:08:51,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {20231#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20232#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:08:51,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {20232#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20232#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:08:51,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {20232#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20233#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:08:51,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {20233#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20233#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:08:51,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {20233#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20234#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:08:51,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {20234#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20234#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:08:51,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {20234#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20235#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:08:51,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {20235#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20235#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:08:51,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {20235#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20236#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:08:51,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {20236#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20236#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:08:51,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {20236#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20237#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:08:51,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {20237#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20237#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:08:51,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {20237#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20238#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:08:51,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {20238#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20238#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:08:51,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {20238#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20239#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:08:51,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {20239#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20239#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:08:51,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {20239#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20240#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:08:51,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {20240#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20240#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:08:51,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {20240#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20241#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:08:51,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {20241#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20241#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:08:51,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {20241#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20242#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:08:51,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {20242#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20242#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:08:51,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {20242#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20243#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:08:51,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {20243#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20243#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:08:51,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {20243#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20244#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:08:51,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {20244#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20244#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:08:51,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {20244#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20245#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:08:51,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {20245#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20245#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:08:51,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {20245#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20246#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:08:51,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {20246#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20246#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:08:51,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {20246#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20247#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:08:51,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {20247#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20247#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:08:51,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {20247#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20248#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:08:51,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {20248#(and (<= main_~k~0 28) (<= 28 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20248#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:08:51,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {20248#(and (<= main_~k~0 28) (<= 28 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20249#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:08:51,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {20249#(and (<= 29 main_~k~0) (<= main_~k~0 29))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20249#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:08:51,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {20249#(and (<= 29 main_~k~0) (<= main_~k~0 29))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20250#(and (<= main_~k~0 30) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {20250#(and (<= main_~k~0 30) (not (<= (+ (div main_~k~0 4294967296) 1) 0)))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {20216#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {20216#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {20216#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {20216#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {20216#false} assume 0 != ~a~0 % 4294967296; {20216#false} is VALID [2022-04-15 12:08:51,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {20216#false} assume !false; {20216#false} is VALID [2022-04-15 12:08:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 2 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:08:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:08:51,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823466857] [2022-04-15 12:08:51,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823466857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:08:51,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801418558] [2022-04-15 12:08:51,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:08:51,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:08:51,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:08:51,946 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:08:51,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:08:52,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:08:52,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:08:52,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:08:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:52,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:08:52,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {20215#true} call ULTIMATE.init(); {20215#true} is VALID [2022-04-15 12:08:52,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {20215#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {20215#true} is VALID [2022-04-15 12:08:52,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {20215#true} assume true; {20215#true} is VALID [2022-04-15 12:08:52,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20215#true} {20215#true} #54#return; {20215#true} is VALID [2022-04-15 12:08:52,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {20215#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {20215#true} is VALID [2022-04-15 12:08:52,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {20215#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {20270#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {20270#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {20270#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {20270#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {20270#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {20270#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {20270#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {20270#(= main_~i~0 0)} is VALID [2022-04-15 12:08:52,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {20270#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20469#(= main_~i~0 1)} is VALID [2022-04-15 12:08:52,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {20469#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {20216#false} is VALID [2022-04-15 12:08:52,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {20216#false} assume 0 != ~a~0 % 4294967296; {20216#false} is VALID [2022-04-15 12:08:52,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {20216#false} assume !false; {20216#false} is VALID [2022-04-15 12:08:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-04-15 12:08:52,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:08:52,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {20216#false} assume !false; {20216#false} is VALID [2022-04-15 12:08:52,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {20216#false} assume 0 != ~a~0 % 4294967296; {20216#false} is VALID [2022-04-15 12:08:52,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {20485#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {20216#false} is VALID [2022-04-15 12:08:52,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20485#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,855 INFO L290 TraceCheckUtils]: 67: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,859 INFO L290 TraceCheckUtils]: 50: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {20215#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {20489#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:08:52,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {20215#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {20215#true} is VALID [2022-04-15 12:08:52,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20215#true} {20215#true} #54#return; {20215#true} is VALID [2022-04-15 12:08:52,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {20215#true} assume true; {20215#true} is VALID [2022-04-15 12:08:52,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {20215#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {20215#true} is VALID [2022-04-15 12:08:52,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {20215#true} call ULTIMATE.init(); {20215#true} is VALID [2022-04-15 12:08:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-04-15 12:08:52,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801418558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:08:52,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:08:52,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 4, 4] total 38 [2022-04-15 12:08:52,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:08:52,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522327727] [2022-04-15 12:08:52,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522327727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:08:52,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:08:52,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:08:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616416186] [2022-04-15 12:08:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:08:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:08:52,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:08:52,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:08:54,185 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 12:08:54,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:08:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:08:54,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:08:54,186 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:21,501 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2022-04-15 12:10:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:10:21,501 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:10:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-15 12:10:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-15 12:10:21,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 94 transitions. [2022-04-15 12:10:22,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:22,890 INFO L225 Difference]: With dead ends: 148 [2022-04-15 12:10:22,890 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:10:22,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:10:22,891 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:10:22,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 146 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 32.5s Time] [2022-04-15 12:10:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:10:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-04-15 12:10:22,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:10:22,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:22,955 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:22,955 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:22,955 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-04-15 12:10:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-15 12:10:22,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:22,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:22,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 12:10:22,956 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 12:10:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:22,956 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-04-15 12:10:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-15 12:10:22,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:22,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:22,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:10:22,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:10:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-04-15 12:10:22,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2022-04-15 12:10:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:10:22,957 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-04-15 12:10:22,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:22,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 80 transitions. [2022-04-15 12:10:23,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 12:10:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:10:23,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:10:23,930 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:10:23,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:10:24,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-15 12:10:24,130 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:10:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:10:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2081913987, now seen corresponding path program 61 times [2022-04-15 12:10:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884316251] [2022-04-15 12:10:26,754 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:26,754 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:27,302 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:27,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:10:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2081913987, now seen corresponding path program 62 times [2022-04-15 12:10:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:10:27,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122498978] [2022-04-15 12:10:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:10:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:10:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:10:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:27,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {21356#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {21319#true} is VALID [2022-04-15 12:10:27,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {21319#true} assume true; {21319#true} is VALID [2022-04-15 12:10:27,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21319#true} {21319#true} #54#return; {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {21319#true} call ULTIMATE.init(); {21356#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {21356#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {21319#true} assume true; {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21319#true} {21319#true} #54#return; {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {21319#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {21319#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {21319#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {21319#true} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {21319#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {21324#(= main_~k~0 0)} is VALID [2022-04-15 12:10:27,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {21324#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21324#(= main_~k~0 0)} is VALID [2022-04-15 12:10:27,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {21324#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21325#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:10:27,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {21325#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21325#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:10:27,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {21325#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21326#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:10:27,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {21326#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21326#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:10:27,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {21326#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21327#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:10:27,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {21327#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21327#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:10:27,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {21327#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21328#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:10:27,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {21328#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21328#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:10:27,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {21328#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21329#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:10:27,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {21329#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21329#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:10:27,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {21329#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21330#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:10:27,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {21330#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21330#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:10:27,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {21330#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21331#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:10:27,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {21331#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21331#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:10:28,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {21331#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21332#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:10:28,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {21332#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21332#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:10:28,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {21332#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21333#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:10:28,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {21333#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21333#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:10:28,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {21333#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21334#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:10:28,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {21334#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21334#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:10:28,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {21334#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21335#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:10:28,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {21335#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21335#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:10:28,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {21335#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21336#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:10:28,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {21336#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21336#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:10:28,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {21336#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21337#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:10:28,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {21337#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21337#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:10:28,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {21337#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21338#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:10:28,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {21338#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21338#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:10:28,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {21338#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21339#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:10:28,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {21339#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21339#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:10:28,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {21339#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21340#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:10:28,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {21340#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21340#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:10:28,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {21340#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21341#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:10:28,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {21341#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21341#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:10:28,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {21341#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21342#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:10:28,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {21342#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21342#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:10:28,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {21342#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21343#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:10:28,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {21343#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21343#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:10:28,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {21343#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21344#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:10:28,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {21344#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21344#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:10:28,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {21344#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21345#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:10:28,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {21345#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21345#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:10:28,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {21345#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21346#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:10:28,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {21346#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21346#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:10:28,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {21346#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21347#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:10:28,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {21347#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21347#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:10:28,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {21347#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21348#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:10:28,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {21348#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21348#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:10:28,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {21348#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21349#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:10:28,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {21349#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21349#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:10:28,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {21349#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21350#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:10:28,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {21350#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21350#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:10:28,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {21350#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21351#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:10:28,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {21351#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21351#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:10:28,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {21351#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21352#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:10:28,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {21352#(and (<= main_~k~0 28) (<= 28 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21352#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:10:28,048 INFO L290 TraceCheckUtils]: 65: Hoare triple {21352#(and (<= main_~k~0 28) (<= 28 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21353#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:10:28,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {21353#(and (<= 29 main_~k~0) (<= main_~k~0 29))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21353#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:10:28,050 INFO L290 TraceCheckUtils]: 67: Hoare triple {21353#(and (<= 29 main_~k~0) (<= main_~k~0 29))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21354#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:10:28,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {21354#(and (<= main_~k~0 30) (<= 30 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21354#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:10:28,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {21354#(and (<= main_~k~0 30) (<= 30 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21355#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 31))} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {21355#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 31))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {21320#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {21320#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {21320#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {21320#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {21320#false} assume 0 != ~a~0 % 4294967296; {21320#false} is VALID [2022-04-15 12:10:28,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {21320#false} assume !false; {21320#false} is VALID [2022-04-15 12:10:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 2 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:10:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:10:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122498978] [2022-04-15 12:10:28,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122498978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:10:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359551111] [2022-04-15 12:10:28,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:10:28,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:10:28,055 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:10:28,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:10:28,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:10:28,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:10:28,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:10:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:28,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:10:28,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {21319#true} call ULTIMATE.init(); {21319#true} is VALID [2022-04-15 12:10:28,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {21319#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {21319#true} is VALID [2022-04-15 12:10:28,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {21319#true} assume true; {21319#true} is VALID [2022-04-15 12:10:28,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21319#true} {21319#true} #54#return; {21319#true} is VALID [2022-04-15 12:10:28,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {21319#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {21319#true} is VALID [2022-04-15 12:10:28,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {21319#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {21375#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {21375#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {21382#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:10:28,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {21382#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21382#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:10:28,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {21382#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21389#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:10:28,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {21389#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {21375#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {21375#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {21375#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,534 INFO L290 TraceCheckUtils]: 71: Hoare triple {21375#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {21375#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {21375#(= main_~i~0 0)} is VALID [2022-04-15 12:10:28,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {21375#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21582#(= main_~i~0 1)} is VALID [2022-04-15 12:10:28,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {21582#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {21320#false} is VALID [2022-04-15 12:10:28,535 INFO L290 TraceCheckUtils]: 75: Hoare triple {21320#false} assume 0 != ~a~0 % 4294967296; {21320#false} is VALID [2022-04-15 12:10:28,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {21320#false} assume !false; {21320#false} is VALID [2022-04-15 12:10:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2022-04-15 12:10:28,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:10:29,247 INFO L290 TraceCheckUtils]: 76: Hoare triple {21320#false} assume !false; {21320#false} is VALID [2022-04-15 12:10:29,247 INFO L290 TraceCheckUtils]: 75: Hoare triple {21320#false} assume 0 != ~a~0 % 4294967296; {21320#false} is VALID [2022-04-15 12:10:29,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {21598#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {21320#false} is VALID [2022-04-15 12:10:29,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21598#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {21792#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {21796#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21792#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:10:29,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {21796#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {21796#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:10:29,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {21796#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:10:29,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {21319#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {21602#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:10:29,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {21319#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {21319#true} is VALID [2022-04-15 12:10:29,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21319#true} {21319#true} #54#return; {21319#true} is VALID [2022-04-15 12:10:29,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {21319#true} assume true; {21319#true} is VALID [2022-04-15 12:10:29,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {21319#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {21319#true} is VALID [2022-04-15 12:10:29,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {21319#true} call ULTIMATE.init(); {21319#true} is VALID [2022-04-15 12:10:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2022-04-15 12:10:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359551111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:10:29,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:10:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 6, 6] total 43 [2022-04-15 12:10:29,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:10:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884316251] [2022-04-15 12:10:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884316251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:10:29,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:10:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:10:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666303637] [2022-04-15 12:10:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:10:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:10:29,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:10:29,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:30,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:30,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:10:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:10:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1668, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:10:30,664 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:20,812 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-04-15 12:12:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:12:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:12:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:12:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-15 12:12:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-15 12:12:20,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 96 transitions. [2022-04-15 12:12:22,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:12:22,520 INFO L225 Difference]: With dead ends: 152 [2022-04-15 12:12:22,520 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 12:12:22,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=1749, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:12:22,521 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:12:22,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 39.7s Time] [2022-04-15 12:12:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 12:12:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-15 12:12:22,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:12:22,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:22,584 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:22,584 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:22,585 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-15 12:12:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-15 12:12:22,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:12:22,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:12:22,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 12:12:22,586 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 12:12:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:22,586 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-15 12:12:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-15 12:12:22,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:12:22,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:12:22,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:12:22,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:12:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-04-15 12:12:22,587 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2022-04-15 12:12:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:12:22,587 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-04-15 12:12:22,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:22,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 82 transitions. [2022-04-15 12:12:23,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:12:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-15 12:12:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 12:12:23,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:12:23,760 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:12:23,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 12:12:23,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:12:23,962 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:12:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:12:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1436923675, now seen corresponding path program 63 times [2022-04-15 12:12:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:12:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902448443] [2022-04-15 12:12:26,429 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:12:26,429 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:12:27,119 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:12:27,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:12:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1436923675, now seen corresponding path program 64 times [2022-04-15 12:12:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:12:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839897621] [2022-04-15 12:12:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:12:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:12:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:12:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:27,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {22494#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22456#true} is VALID [2022-04-15 12:12:27,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {22456#true} assume true; {22456#true} is VALID [2022-04-15 12:12:27,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22456#true} {22456#true} #54#return; {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {22456#true} call ULTIMATE.init(); {22494#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:12:27,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {22494#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {22456#true} assume true; {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22456#true} {22456#true} #54#return; {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {22456#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {22456#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22456#true} is VALID [2022-04-15 12:12:27,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {22456#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {22456#true} is VALID [2022-04-15 12:12:27,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {22456#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {22461#(= main_~k~0 0)} is VALID [2022-04-15 12:12:27,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {22461#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22461#(= main_~k~0 0)} is VALID [2022-04-15 12:12:27,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {22461#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22462#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:12:27,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {22462#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22462#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:12:27,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {22462#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22463#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:12:27,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {22463#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22463#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:12:27,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {22463#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22464#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:12:27,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {22464#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22464#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:12:27,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {22464#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22465#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:12:27,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {22465#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22465#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:12:27,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {22465#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22466#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:12:27,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {22466#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22466#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:12:27,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {22466#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22467#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:12:27,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {22467#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22467#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:12:27,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {22467#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22468#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:12:27,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {22468#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22468#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:12:27,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {22468#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22469#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:12:27,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {22469#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22469#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:12:27,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {22469#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22470#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:12:27,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {22470#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22470#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:12:27,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {22470#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22471#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:12:27,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {22471#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22471#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:12:27,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {22471#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22472#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:12:27,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {22472#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22472#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:12:27,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {22472#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22473#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:12:27,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {22473#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22473#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:12:27,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {22473#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22474#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:12:27,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {22474#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22474#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:12:27,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {22474#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22475#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:12:27,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {22475#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22475#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:12:27,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {22475#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22476#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:12:27,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {22476#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22476#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:12:27,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {22476#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22477#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:12:27,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {22477#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22477#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:12:27,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {22477#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22478#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:12:27,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {22478#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22478#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:12:27,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {22478#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22479#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:12:27,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {22479#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22479#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:12:27,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {22479#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22480#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:12:27,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {22480#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22480#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:12:27,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {22480#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22481#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:12:27,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {22481#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22481#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:12:27,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {22481#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22482#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:12:27,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {22482#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22482#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:12:27,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {22482#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22483#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:12:27,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {22483#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22483#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:12:27,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {22483#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22484#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:12:27,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {22484#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22484#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:12:27,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {22484#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22485#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:12:27,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {22485#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22485#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:12:27,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {22485#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22486#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:12:27,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {22486#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22486#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:12:27,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {22486#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22487#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:12:27,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {22487#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22487#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:12:27,998 INFO L290 TraceCheckUtils]: 61: Hoare triple {22487#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22488#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:12:27,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {22488#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22488#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:12:28,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {22488#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22489#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:12:28,001 INFO L290 TraceCheckUtils]: 64: Hoare triple {22489#(and (<= main_~k~0 28) (<= 28 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22489#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:12:28,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {22489#(and (<= main_~k~0 28) (<= 28 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22490#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:12:28,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {22490#(and (<= 29 main_~k~0) (<= main_~k~0 29))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22490#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:12:28,005 INFO L290 TraceCheckUtils]: 67: Hoare triple {22490#(and (<= 29 main_~k~0) (<= main_~k~0 29))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22491#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:12:28,005 INFO L290 TraceCheckUtils]: 68: Hoare triple {22491#(and (<= main_~k~0 30) (<= 30 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22491#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:12:28,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {22491#(and (<= main_~k~0 30) (<= 30 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22492#(and (<= main_~k~0 31) (<= 31 main_~k~0))} is VALID [2022-04-15 12:12:28,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {22492#(and (<= main_~k~0 31) (<= 31 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22492#(and (<= main_~k~0 31) (<= 31 main_~k~0))} is VALID [2022-04-15 12:12:28,010 INFO L290 TraceCheckUtils]: 71: Hoare triple {22492#(and (<= main_~k~0 31) (<= 31 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22493#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 32))} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {22493#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 32))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {22457#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {22457#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {22457#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {22457#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {22457#false} assume 0 != ~a~0 % 4294967296; {22457#false} is VALID [2022-04-15 12:12:28,011 INFO L290 TraceCheckUtils]: 78: Hoare triple {22457#false} assume !false; {22457#false} is VALID [2022-04-15 12:12:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 2 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:12:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:12:28,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839897621] [2022-04-15 12:12:28,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839897621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:12:28,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716654099] [2022-04-15 12:12:28,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:12:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:12:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:12:28,013 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:12:28,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 12:12:28,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:12:28,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:12:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:12:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:28,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:12:28,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {22456#true} call ULTIMATE.init(); {22456#true} is VALID [2022-04-15 12:12:28,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {22456#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22456#true} is VALID [2022-04-15 12:12:28,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {22456#true} assume true; {22456#true} is VALID [2022-04-15 12:12:28,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22456#true} {22456#true} #54#return; {22456#true} is VALID [2022-04-15 12:12:28,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {22456#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22456#true} is VALID [2022-04-15 12:12:28,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {22456#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {22513#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {22513#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {22520#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:12:28,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {22520#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22520#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 12:12:28,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {22520#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22527#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-15 12:12:28,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {22527#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {22513#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,501 INFO L290 TraceCheckUtils]: 71: Hoare triple {22513#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {22513#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {22513#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {22513#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {22513#(= main_~i~0 0)} is VALID [2022-04-15 12:12:28,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {22513#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22726#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:12:28,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {22726#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {22457#false} is VALID [2022-04-15 12:12:28,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {22457#false} assume 0 != ~a~0 % 4294967296; {22457#false} is VALID [2022-04-15 12:12:28,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {22457#false} assume !false; {22457#false} is VALID [2022-04-15 12:12:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2022-04-15 12:12:28,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:12:29,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {22457#false} assume !false; {22457#false} is VALID [2022-04-15 12:12:29,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {22457#false} assume 0 != ~a~0 % 4294967296; {22457#false} is VALID [2022-04-15 12:12:29,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {22742#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {22457#false} is VALID [2022-04-15 12:12:29,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22742#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {22942#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {22946#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {22942#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:12:29,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {22946#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {22946#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:12:29,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {22946#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 12:12:29,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {22456#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22746#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:12:29,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {22456#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22456#true} is VALID [2022-04-15 12:12:29,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22456#true} {22456#true} #54#return; {22456#true} is VALID [2022-04-15 12:12:29,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {22456#true} assume true; {22456#true} is VALID [2022-04-15 12:12:29,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {22456#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22456#true} is VALID [2022-04-15 12:12:29,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {22456#true} call ULTIMATE.init(); {22456#true} is VALID [2022-04-15 12:12:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2022-04-15 12:12:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716654099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:12:29,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:12:29,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 6, 6] total 44 [2022-04-15 12:12:29,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:12:29,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902448443] [2022-04-15 12:12:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902448443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:12:29,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:12:29,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:12:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441491821] [2022-04-15 12:12:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:12:29,361 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:12:29,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:12:29,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:12:30,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:12:30,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:12:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:12:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:12:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:12:30,966 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:42,022 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2022-04-15 12:14:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:14:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:14:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:14:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 98 transitions. [2022-04-15 12:14:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 98 transitions. [2022-04-15 12:14:42,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 98 transitions. [2022-04-15 12:14:44,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:14:44,063 INFO L225 Difference]: With dead ends: 156 [2022-04-15 12:14:44,063 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 12:14:44,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=1834, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:14:44,064 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:14:44,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 47.4s Time] [2022-04-15 12:14:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 12:14:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-15 12:14:44,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:14:44,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:44,129 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:44,129 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:44,130 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 12:14:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 12:14:44,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:44,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:44,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 12:14:44,130 INFO L87 Difference]: Start difference. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 12:14:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:44,131 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 12:14:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 12:14:44,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:44,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:44,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:14:44,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:14:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-04-15 12:14:44,132 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2022-04-15 12:14:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:14:44,132 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-04-15 12:14:44,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:44,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 84 transitions. [2022-04-15 12:14:45,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:14:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-15 12:14:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 12:14:45,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:14:45,361 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:14:45,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 12:14:45,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:14:45,561 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:14:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:14:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1394312391, now seen corresponding path program 65 times [2022-04-15 12:14:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:14:45,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373902635] [2022-04-15 12:14:47,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:14:47,147 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:14:47,923 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:14:47,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:14:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1394312391, now seen corresponding path program 66 times [2022-04-15 12:14:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:14:47,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653369180] [2022-04-15 12:14:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:14:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:14:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:14:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:48,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {23661#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {23622#true} assume true; {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23622#true} {23622#true} #54#return; {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {23622#true} call ULTIMATE.init(); {23661#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:14:48,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {23661#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {23622#true} assume true; {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23622#true} {23622#true} #54#return; {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {23622#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {23622#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {23622#true} is VALID [2022-04-15 12:14:48,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {23622#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {23622#true} is VALID [2022-04-15 12:14:48,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {23622#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {23627#(= main_~k~0 0)} is VALID [2022-04-15 12:14:48,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {23627#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23627#(= main_~k~0 0)} is VALID [2022-04-15 12:14:48,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {23627#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23628#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:14:48,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {23628#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23628#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 12:14:48,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23629#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:14:48,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {23629#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23629#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 12:14:48,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {23629#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23630#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:14:48,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {23630#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23630#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-15 12:14:48,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {23630#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23631#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:14:48,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {23631#(and (<= 4 main_~k~0) (<= main_~k~0 4))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23631#(and (<= 4 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 12:14:48,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {23631#(and (<= 4 main_~k~0) (<= main_~k~0 4))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23632#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:14:48,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {23632#(and (<= main_~k~0 5) (<= 5 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23632#(and (<= main_~k~0 5) (<= 5 main_~k~0))} is VALID [2022-04-15 12:14:48,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {23632#(and (<= main_~k~0 5) (<= 5 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23633#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:14:48,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {23633#(and (<= main_~k~0 6) (<= 6 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23633#(and (<= main_~k~0 6) (<= 6 main_~k~0))} is VALID [2022-04-15 12:14:48,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {23633#(and (<= main_~k~0 6) (<= 6 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23634#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:14:48,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {23634#(and (<= main_~k~0 7) (<= 7 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23634#(and (<= main_~k~0 7) (<= 7 main_~k~0))} is VALID [2022-04-15 12:14:48,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {23634#(and (<= main_~k~0 7) (<= 7 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23635#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:14:48,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {23635#(and (<= 8 main_~k~0) (<= main_~k~0 8))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23635#(and (<= 8 main_~k~0) (<= main_~k~0 8))} is VALID [2022-04-15 12:14:48,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {23635#(and (<= 8 main_~k~0) (<= main_~k~0 8))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23636#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:14:48,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {23636#(and (<= 9 main_~k~0) (<= main_~k~0 9))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23636#(and (<= 9 main_~k~0) (<= main_~k~0 9))} is VALID [2022-04-15 12:14:48,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {23636#(and (<= 9 main_~k~0) (<= main_~k~0 9))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23637#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:14:48,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {23637#(and (<= main_~k~0 10) (<= 10 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23637#(and (<= main_~k~0 10) (<= 10 main_~k~0))} is VALID [2022-04-15 12:14:48,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {23637#(and (<= main_~k~0 10) (<= 10 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23638#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:14:48,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {23638#(and (<= 11 main_~k~0) (<= main_~k~0 11))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23638#(and (<= 11 main_~k~0) (<= main_~k~0 11))} is VALID [2022-04-15 12:14:48,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {23638#(and (<= 11 main_~k~0) (<= main_~k~0 11))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23639#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:14:48,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {23639#(and (<= 12 main_~k~0) (<= main_~k~0 12))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23639#(and (<= 12 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-15 12:14:48,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {23639#(and (<= 12 main_~k~0) (<= main_~k~0 12))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23640#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:14:48,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {23640#(and (<= main_~k~0 13) (<= 13 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23640#(and (<= main_~k~0 13) (<= 13 main_~k~0))} is VALID [2022-04-15 12:14:48,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {23640#(and (<= main_~k~0 13) (<= 13 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23641#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:14:48,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {23641#(and (<= 14 main_~k~0) (<= main_~k~0 14))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23641#(and (<= 14 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-15 12:14:48,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {23641#(and (<= 14 main_~k~0) (<= main_~k~0 14))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23642#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:14:48,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {23642#(and (<= 15 main_~k~0) (<= main_~k~0 15))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23642#(and (<= 15 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-15 12:14:48,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {23642#(and (<= 15 main_~k~0) (<= main_~k~0 15))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23643#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:14:48,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {23643#(and (<= main_~k~0 16) (<= 16 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23643#(and (<= main_~k~0 16) (<= 16 main_~k~0))} is VALID [2022-04-15 12:14:48,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {23643#(and (<= main_~k~0 16) (<= 16 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23644#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:14:48,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {23644#(and (<= 17 main_~k~0) (<= main_~k~0 17))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23644#(and (<= 17 main_~k~0) (<= main_~k~0 17))} is VALID [2022-04-15 12:14:48,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {23644#(and (<= 17 main_~k~0) (<= main_~k~0 17))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23645#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:14:48,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {23645#(and (<= 18 main_~k~0) (<= main_~k~0 18))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23645#(and (<= 18 main_~k~0) (<= main_~k~0 18))} is VALID [2022-04-15 12:14:48,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {23645#(and (<= 18 main_~k~0) (<= main_~k~0 18))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23646#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:14:48,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {23646#(and (<= main_~k~0 19) (<= 19 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23646#(and (<= main_~k~0 19) (<= 19 main_~k~0))} is VALID [2022-04-15 12:14:48,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {23646#(and (<= main_~k~0 19) (<= 19 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23647#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:14:48,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {23647#(and (<= main_~k~0 20) (<= 20 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23647#(and (<= main_~k~0 20) (<= 20 main_~k~0))} is VALID [2022-04-15 12:14:48,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {23647#(and (<= main_~k~0 20) (<= 20 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23648#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:14:48,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {23648#(and (<= 21 main_~k~0) (<= main_~k~0 21))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23648#(and (<= 21 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-15 12:14:48,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {23648#(and (<= 21 main_~k~0) (<= main_~k~0 21))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23649#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:14:48,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {23649#(and (<= main_~k~0 22) (<= 22 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23649#(and (<= main_~k~0 22) (<= 22 main_~k~0))} is VALID [2022-04-15 12:14:48,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {23649#(and (<= main_~k~0 22) (<= 22 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23650#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:14:48,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {23650#(and (<= main_~k~0 23) (<= 23 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23650#(and (<= main_~k~0 23) (<= 23 main_~k~0))} is VALID [2022-04-15 12:14:48,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {23650#(and (<= main_~k~0 23) (<= 23 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23651#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:14:48,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {23651#(and (<= main_~k~0 24) (<= 24 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23651#(and (<= main_~k~0 24) (<= 24 main_~k~0))} is VALID [2022-04-15 12:14:48,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {23651#(and (<= main_~k~0 24) (<= 24 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23652#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:14:48,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {23652#(and (<= main_~k~0 25) (<= 25 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23652#(and (<= main_~k~0 25) (<= 25 main_~k~0))} is VALID [2022-04-15 12:14:48,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {23652#(and (<= main_~k~0 25) (<= 25 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23653#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:14:48,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {23653#(and (<= main_~k~0 26) (<= 26 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23653#(and (<= main_~k~0 26) (<= 26 main_~k~0))} is VALID [2022-04-15 12:14:48,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {23653#(and (<= main_~k~0 26) (<= 26 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23654#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:14:48,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {23654#(and (<= 27 main_~k~0) (<= main_~k~0 27))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23654#(and (<= 27 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-15 12:14:48,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {23654#(and (<= 27 main_~k~0) (<= main_~k~0 27))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23655#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:14:48,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {23655#(and (<= main_~k~0 28) (<= 28 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23655#(and (<= main_~k~0 28) (<= 28 main_~k~0))} is VALID [2022-04-15 12:14:48,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {23655#(and (<= main_~k~0 28) (<= 28 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23656#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:14:48,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {23656#(and (<= 29 main_~k~0) (<= main_~k~0 29))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23656#(and (<= 29 main_~k~0) (<= main_~k~0 29))} is VALID [2022-04-15 12:14:48,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {23656#(and (<= 29 main_~k~0) (<= main_~k~0 29))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23657#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:14:48,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {23657#(and (<= main_~k~0 30) (<= 30 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23657#(and (<= main_~k~0 30) (<= 30 main_~k~0))} is VALID [2022-04-15 12:14:48,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {23657#(and (<= main_~k~0 30) (<= 30 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23658#(and (<= main_~k~0 31) (<= 31 main_~k~0))} is VALID [2022-04-15 12:14:48,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {23658#(and (<= main_~k~0 31) (<= 31 main_~k~0))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23658#(and (<= main_~k~0 31) (<= 31 main_~k~0))} is VALID [2022-04-15 12:14:48,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {23658#(and (<= main_~k~0 31) (<= 31 main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23659#(and (<= 32 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-15 12:14:48,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {23659#(and (<= 32 main_~k~0) (<= main_~k~0 32))} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23659#(and (<= 32 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-15 12:14:48,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {23659#(and (<= 32 main_~k~0) (<= main_~k~0 32))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23660#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 33))} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {23660#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 33))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {23623#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {23623#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {23623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {23623#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {23623#false} assume 0 != ~a~0 % 4294967296; {23623#false} is VALID [2022-04-15 12:14:48,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {23623#false} assume !false; {23623#false} is VALID [2022-04-15 12:14:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 2 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:14:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:14:48,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653369180] [2022-04-15 12:14:48,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653369180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:14:48,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217583801] [2022-04-15 12:14:48,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:14:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:14:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:14:48,778 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:14:48,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 12:14:48,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:14:48,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:14:48,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:14:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:48,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:14:49,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {23622#true} call ULTIMATE.init(); {23622#true} is VALID [2022-04-15 12:14:49,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {23622#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {23622#true} is VALID [2022-04-15 12:14:49,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {23622#true} assume true; {23622#true} is VALID [2022-04-15 12:14:49,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23622#true} {23622#true} #54#return; {23622#true} is VALID [2022-04-15 12:14:49,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {23622#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {23622#true} is VALID [2022-04-15 12:14:49,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {23622#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {23680#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {23680#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {23680#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {23680#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {23680#(= main_~i~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {23680#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {23680#(= main_~i~0 0)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {23680#(= main_~i~0 0)} is VALID [2022-04-15 12:14:49,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {23680#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23897#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:14:49,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {23897#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {23623#false} is VALID [2022-04-15 12:14:49,215 INFO L290 TraceCheckUtils]: 79: Hoare triple {23623#false} assume 0 != ~a~0 % 4294967296; {23623#false} is VALID [2022-04-15 12:14:49,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {23623#false} assume !false; {23623#false} is VALID [2022-04-15 12:14:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-04-15 12:14:49,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:14:49,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {23623#false} assume !false; {23623#false} is VALID [2022-04-15 12:14:49,810 INFO L290 TraceCheckUtils]: 79: Hoare triple {23623#false} assume 0 != ~a~0 % 4294967296; {23623#false} is VALID [2022-04-15 12:14:49,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {23913#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {23623#false} is VALID [2022-04-15 12:14:49,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23913#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {23622#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {23917#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 12:14:49,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {23622#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {23622#true} is VALID [2022-04-15 12:14:49,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23622#true} {23622#true} #54#return; {23622#true} is VALID [2022-04-15 12:14:49,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {23622#true} assume true; {23622#true} is VALID [2022-04-15 12:14:49,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {23622#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {23622#true} is VALID [2022-04-15 12:14:49,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {23622#true} call ULTIMATE.init(); {23622#true} is VALID [2022-04-15 12:14:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-04-15 12:14:49,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217583801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:14:49,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:14:49,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 4, 4] total 41 [2022-04-15 12:14:49,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:14:49,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373902635] [2022-04-15 12:14:49,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373902635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:14:49,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:14:49,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:14:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13863204] [2022-04-15 12:14:49,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:14:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 12:14:49,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:14:49,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:14:51,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:14:51,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:14:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:14:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:14:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:14:51,666 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)