/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/compact.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:23,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:23,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:23,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:23,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:23,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:23,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:23,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:23,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:23,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:23,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:23,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:23,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:23,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:23,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:23,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:23,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:23,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:23,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:23,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:23,775 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:23,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:23,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:23,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:23,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:23,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:23,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:23,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:23,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:23,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:23,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:23,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:23,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:23,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:23,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:23,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:23,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:23,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:23,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:23,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:23,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:23,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:23,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:23,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:23,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:23,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:23,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:23,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:23,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:23,801 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:23,802 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-28 02:41:23,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:24,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:24,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:24,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:24,035 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:24,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/compact.c [2022-04-28 02:41:24,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e848424/51aaa4e314484c118fd803520da65411/FLAG0610c8361 [2022-04-28 02:41:24,405 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:24,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c [2022-04-28 02:41:24,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e848424/51aaa4e314484c118fd803520da65411/FLAG0610c8361 [2022-04-28 02:41:24,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e848424/51aaa4e314484c118fd803520da65411 [2022-04-28 02:41:24,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:24,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:24,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:24,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:24,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:24,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c26499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24, skipping insertion in model container [2022-04-28 02:41:24,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:24,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:24,564 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/compact.c[609,622] [2022-04-28 02:41:24,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:24,571 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:24,580 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/compact.c[609,622] [2022-04-28 02:41:24,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:24,589 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:24,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24 WrapperNode [2022-04-28 02:41:24,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:24,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:24,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:24,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:24,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:24,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:24,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:24,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:24,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (1/1) ... [2022-04-28 02:41:24,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:24,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:24,635 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-28 02:41:24,638 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-28 02:41:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:24,714 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:24,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:24,858 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:24,862 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:24,863 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 02:41:24,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:24 BoogieIcfgContainer [2022-04-28 02:41:24,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:24,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:24,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:24,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:24" (1/3) ... [2022-04-28 02:41:24,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e70dc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:24, skipping insertion in model container [2022-04-28 02:41:24,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:24" (2/3) ... [2022-04-28 02:41:24,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e70dc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:24, skipping insertion in model container [2022-04-28 02:41:24,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:24" (3/3) ... [2022-04-28 02:41:24,870 INFO L111 eAbstractionObserver]: Analyzing ICFG compact.c [2022-04-28 02:41:24,879 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:24,879 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:24,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:24,934 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e598d0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59c40ac3 [2022-04-28 02:41:24,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-28 02:41:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-28 02:41:24,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:24,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:24,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 1 times [2022-04-28 02:41:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:24,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155810689] [2022-04-28 02:41:24,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 2 times [2022-04-28 02:41:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:24,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710912891] [2022-04-28 02:41:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-28 02:41:25,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:41:25,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-28 02:41:25,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(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-28 02:41:25,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-28 02:41:25,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:41:25,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-28 02:41:25,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {21#true} is VALID [2022-04-28 02:41:25,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {21#true} is VALID [2022-04-28 02:41:25,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 02:41:25,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-04-28 02:41:25,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-04-28 02:41:25,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 02:41:25,163 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-28 02:41:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:25,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710912891] [2022-04-28 02:41:25,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710912891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:25,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:25,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:25,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155810689] [2022-04-28 02:41:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155810689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:25,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:25,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842625099] [2022-04-28 02:41:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 10 [2022-04-28 02:41:25,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:25,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:41:25,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:41:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:41:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:25,211 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:41:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,336 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 02:41:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:41:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 10 [2022-04-28 02:41:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:41:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-28 02:41:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:41:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-28 02:41:25,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-28 02:41:25,409 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-28 02:41:25,414 INFO L225 Difference]: With dead ends: 37 [2022-04-28 02:41:25,414 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 02:41:25,416 INFO L412 NwaCegarLoop]: 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-28 02:41:25,418 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:25,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 02:41:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2022-04-28 02:41:25,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:25,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 02:41:25,440 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 02:41:25,440 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 02:41:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,442 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 02:41:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 02:41:25,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:25,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:25,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 21 states. [2022-04-28 02:41:25,443 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 21 states. [2022-04-28 02:41:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,445 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 02:41:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 02:41:25,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:25,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:25,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:25,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 02:41:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 02:41:25,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2022-04-28 02:41:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:25,448 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 02:41:25,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-28 02:41:25,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 02:41:25,461 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-28 02:41:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:41:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-28 02:41:25,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:25,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:25,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:25,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 1 times [2022-04-28 02:41:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645406080] [2022-04-28 02:41:25,463 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 2 times [2022-04-28 02:41:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:25,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162620668] [2022-04-28 02:41:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-28 02:41:25,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 02:41:25,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-28 02:41:25,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {179#(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-28 02:41:25,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-28 02:41:25,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 02:41:25,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-28 02:41:25,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {173#true} is VALID [2022-04-28 02:41:25,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {178#(= main_~i~0 0)} is VALID [2022-04-28 02:41:25,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 102400); {174#false} is VALID [2022-04-28 02:41:25,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#false} ~i~0 := 0; {174#false} is VALID [2022-04-28 02:41:25,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#false} assume !(~i~0 % 4294967296 < 102400); {174#false} is VALID [2022-04-28 02:41:25,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-28 02:41:25,548 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-28 02:41:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:25,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162620668] [2022-04-28 02:41:25,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162620668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:25,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:25,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:25,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:25,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645406080] [2022-04-28 02:41:25,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645406080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:25,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:25,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883177842] [2022-04-28 02:41:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2022-04-28 02:41:25,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:25,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:41:25,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:25,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:41:25,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:25,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:41:25,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:41:25,559 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:41:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,652 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 02:41:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:41:25,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2022-04-28 02:41:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:41:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 02:41:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:41:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 02:41:25,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 02:41:25,685 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-28 02:41:25,687 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:41:25,687 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 02:41:25,688 INFO L412 NwaCegarLoop]: 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-28 02:41:25,690 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:25,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 02:41:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-04-28 02:41:25,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:25,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-28 02:41:25,694 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-28 02:41:25,695 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-28 02:41:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,696 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 02:41:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 02:41:25,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:25,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:25,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 19 states. [2022-04-28 02:41:25,697 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 19 states. [2022-04-28 02:41:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:25,698 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 02:41:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 02:41:25,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:25,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:25,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:25,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-28 02:41:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 02:41:25,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2022-04-28 02:41:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:25,700 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 02:41:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:41:25,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 02:41:25,713 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-28 02:41:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 02:41:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:25,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:25,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:25,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:25,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 1 times [2022-04-28 02:41:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:25,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537650841] [2022-04-28 02:41:25,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:25,739 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:25,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 2 times [2022-04-28 02:41:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:25,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214022601] [2022-04-28 02:41:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-28 02:41:25,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:25,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-28 02:41:25,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {311#(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-28 02:41:25,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-28 02:41:25,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:25,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-28 02:41:25,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-28 02:41:25,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-28 02:41:25,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-28 02:41:25,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:25,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:25,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-28 02:41:25,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-28 02:41:25,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-28 02:41:25,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-28 02:41:25,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:25,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-28 02:41:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214022601] [2022-04-28 02:41:25,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214022601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:25,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500255067] [2022-04-28 02:41:25,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:25,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:25,876 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-28 02:41:25,881 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-28 02:41:25,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:25,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:25,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:41:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:25,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:26,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-28 02:41:26,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-28 02:41:26,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:26,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-28 02:41:26,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-28 02:41:26,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {336#(= main_~i~0 1)} is VALID [2022-04-28 02:41:26,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:26,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-28 02:41:26,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-28 02:41:26,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-28 02:41:26,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-28 02:41:26,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:26,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-28 02:41:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:26,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-28 02:41:26,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-28 02:41:26,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-28 02:41:26,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {376#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:26,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:26,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:26,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-28 02:41:26,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-28 02:41:26,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:26,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-28 02:41:26,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-28 02:41:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:26,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500255067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:26,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:26,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:41:26,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:26,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537650841] [2022-04-28 02:41:26,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537650841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769843191] [2022-04-28 02:41:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:26,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,142 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-28 02:41:26,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:41:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:41:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:41:26,143 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,230 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 02:41:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:41:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 02:41:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 02:41:26,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-28 02:41:26,256 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-28 02:41:26,257 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:41:26,258 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:41:26,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:26,264 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:26,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:41:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-28 02:41:26,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:26,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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-28 02:41:26,278 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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-28 02:41:26,279 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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-28 02:41:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,281 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 02:41:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 02:41:26,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:26,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:26,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 24 states. [2022-04-28 02:41:26,282 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 24 states. [2022-04-28 02:41:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,284 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 02:41:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 02:41:26,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:26,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:26,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:26,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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-28 02:41:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 02:41:26,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-04-28 02:41:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:26,286 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 02:41:26,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-28 02:41:26,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 02:41:26,309 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-28 02:41:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 02:41:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:41:26,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:26,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:26,330 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-28 02:41:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:26,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 3 times [2022-04-28 02:41:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045616624] [2022-04-28 02:41:26,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:26,544 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:26,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 4 times [2022-04-28 02:41:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:26,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195265336] [2022-04-28 02:41:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-28 02:41:26,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 02:41:26,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-28 02:41:26,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {566#(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-28 02:41:26,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-28 02:41:26,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 02:41:26,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-28 02:41:26,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-28 02:41:26,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {563#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:26,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:26,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:26,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:26,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:26,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:26,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-28 02:41:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 02:41:26,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:26,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195265336] [2022-04-28 02:41:26,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195265336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:26,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628478642] [2022-04-28 02:41:26,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:26,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:26,668 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-28 02:41:26,669 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-28 02:41:26,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:26,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:26,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:41:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:26,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-28 02:41:26,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-28 02:41:26,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 02:41:26,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-28 02:41:26,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-28 02:41:26,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {563#(= main_~i~0 0)} is VALID [2022-04-28 02:41:26,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:26,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:26,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {597#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:26,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:26,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-28 02:41:26,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:26,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:26,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:26,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:26,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:26,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:26,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:26,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-28 02:41:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 02:41:26,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:27,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-28 02:41:27,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:27,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:27,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:27,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:27,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-28 02:41:27,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-28 02:41:27,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-28 02:41:27,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-28 02:41:27,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-28 02:41:27,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {655#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:27,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:27,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:27,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:27,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:27,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-28 02:41:27,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-28 02:41:27,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 02:41:27,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-28 02:41:27,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-28 02:41:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 02:41:27,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628478642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:27,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:27,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:41:27,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045616624] [2022-04-28 02:41:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045616624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:27,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:27,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047387132] [2022-04-28 02:41:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 20 [2022-04-28 02:41:27,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:27,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 02:41:27,084 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-28 02:41:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:41:27,089 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 02:41:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,194 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 02:41:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:41:27,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 20 [2022-04-28 02:41:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 02:41:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 02:41:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 02:41:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 02:41:27,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 02:41:27,223 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-28 02:41:27,224 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:41:27,224 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 02:41:27,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:41:27,225 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:27,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 02:41:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-28 02:41:27,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:27,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-28 02:41:27,238 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-28 02:41:27,238 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-28 02:41:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,239 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 02:41:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 02:41:27,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:27,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:27,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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 29 states. [2022-04-28 02:41:27,240 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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 29 states. [2022-04-28 02:41:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,241 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 02:41:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 02:41:27,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:27,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:27,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:27,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-28 02:41:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 02:41:27,242 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2022-04-28 02:41:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:27,243 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 02:41:27,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 02:41:27,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 02:41:27,261 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-28 02:41:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 02:41:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:27,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:27,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:27,281 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-28 02:41:27,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 02:41:27,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 5 times [2022-04-28 02:41:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741844374] [2022-04-28 02:41:27,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:27,493 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:27,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 6 times [2022-04-28 02:41:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:27,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985841701] [2022-04-28 02:41:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:27,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-28 02:41:27,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 02:41:27,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-28 02:41:27,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {889#(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-28 02:41:27,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-28 02:41:27,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 02:41:27,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-28 02:41:27,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-28 02:41:27,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-28 02:41:27,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {885#(= main_~i~0 0)} is VALID [2022-04-28 02:41:27,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:27,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:27,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:27,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:27,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:27,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 02:41:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 02:41:27,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:27,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985841701] [2022-04-28 02:41:27,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985841701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:27,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780942346] [2022-04-28 02:41:27,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:27,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:27,609 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-28 02:41:27,610 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-28 02:41:27,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:41:27,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:27,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:41:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:27,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:27,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-28 02:41:27,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-28 02:41:27,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 02:41:27,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-28 02:41:27,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-28 02:41:27,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-28 02:41:27,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {885#(= main_~i~0 0)} is VALID [2022-04-28 02:41:27,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:27,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:27,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:27,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:27,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {926#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:27,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 02:41:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 02:41:27,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:27,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-28 02:41:27,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-28 02:41:27,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-28 02:41:27,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-28 02:41:28,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {1002#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-28 02:41:28,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1002#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:28,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:28,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-28 02:41:28,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-28 02:41:28,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 02:41:28,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-28 02:41:28,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-28 02:41:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 02:41:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780942346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:28,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:28,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:41:28,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:28,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741844374] [2022-04-28 02:41:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741844374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:28,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:28,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:41:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374332551] [2022-04-28 02:41:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 25 [2022-04-28 02:41:28,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:28,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 02:41:28,024 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-28 02:41:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:41:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:41:28,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:41:28,025 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 02:41:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:28,208 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 02:41:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:41:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 25 [2022-04-28 02:41:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 02:41:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 02:41:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 02:41:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 02:41:28,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 02:41:28,238 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-28 02:41:28,239 INFO L225 Difference]: With dead ends: 47 [2022-04-28 02:41:28,239 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:41:28,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:41:28,240 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:28,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:41:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-28 02:41:28,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:28,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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-28 02:41:28,259 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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-28 02:41:28,259 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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-28 02:41:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:28,260 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 02:41:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 02:41:28,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:28,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:28,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 34 states. [2022-04-28 02:41:28,261 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 34 states. [2022-04-28 02:41:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:28,261 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 02:41:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 02:41:28,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:28,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:28,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:28,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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-28 02:41:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-28 02:41:28,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2022-04-28 02:41:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:28,263 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-28 02:41:28,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 02:41:28,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-28 02:41:28,284 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-28 02:41:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-28 02:41:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:41:28,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:28,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:28,310 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-28 02:41:28,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:28,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 7 times [2022-04-28 02:41:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005363866] [2022-04-28 02:41:28,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:28,510 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:28,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 8 times [2022-04-28 02:41:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:28,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452453156] [2022-04-28 02:41:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {1280#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-28 02:41:28,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-28 02:41:28,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-28 02:41:28,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1280#(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-28 02:41:28,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-28 02:41:28,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-28 02:41:28,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-28 02:41:28,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-28 02:41:28,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-28 02:41:28,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1275#(= main_~i~0 0)} is VALID [2022-04-28 02:41:28,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:28,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:28,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:28,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:28,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:28,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:28,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:28,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-28 02:41:28,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1271#false} ~i~0 := 0; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-28 02:41:28,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-28 02:41:28,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-28 02:41:28,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {1271#false} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-28 02:41:28,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-28 02:41:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 02:41:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452453156] [2022-04-28 02:41:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452453156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138885605] [2022-04-28 02:41:28,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:28,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:28,635 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-28 02:41:28,636 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-28 02:41:28,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:28,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:41:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:28,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-28 02:41:28,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:28,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:28,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:28,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:28,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:28,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 < 102400); {1270#true} is VALID [2022-04-28 02:41:28,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-28 02:41:28,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1275#(= main_~i~0 0)} is VALID [2022-04-28 02:41:28,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1275#(= main_~i~0 0)} is VALID [2022-04-28 02:41:28,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:28,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:28,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:28,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:28,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:28,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:28,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:28,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:28,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:28,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:28,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-28 02:41:28,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-28 02:41:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 02:41:28,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:29,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-28 02:41:29,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {1375#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-28 02:41:29,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1375#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:29,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 < 102400); {1270#true} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:29,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-28 02:41:29,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-28 02:41:29,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-28 02:41:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 02:41:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138885605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:29,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:29,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:41:29,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005363866] [2022-04-28 02:41:29,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005363866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432187818] [2022-04-28 02:41:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 30 [2022-04-28 02:41:29,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:29,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 02:41:29,135 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-28 02:41:29,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:41:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:41:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:41:29,136 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 02:41:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:29,356 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-28 02:41:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:41:29,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 30 [2022-04-28 02:41:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 02:41:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-28 02:41:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 02:41:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-28 02:41:29,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-28 02:41:29,390 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-28 02:41:29,390 INFO L225 Difference]: With dead ends: 55 [2022-04-28 02:41:29,391 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 02:41:29,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:41:29,391 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:29,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 02:41:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-28 02:41:29,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:29,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,412 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,412 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:29,413 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 02:41:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-28 02:41:29,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:29,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:29,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,414 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:29,415 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 02:41:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-28 02:41:29,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:29,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:29,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:29,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-28 02:41:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 02:41:29,416 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-04-28 02:41:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:29,417 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 02:41:29,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 02:41:29,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 02:41:29,442 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-28 02:41:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 02:41:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 02:41:29,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:29,443 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:29,459 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-28 02:41:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:29,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 9 times [2022-04-28 02:41:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:29,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735642385] [2022-04-28 02:41:29,680 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:29,680 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:29,680 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 10 times [2022-04-28 02:41:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202204544] [2022-04-28 02:41:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:29,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {1739#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-28 02:41:29,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-28 02:41:29,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-28 02:41:29,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1739#(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-28 02:41:29,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1739#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-28 02:41:29,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-28 02:41:29,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-28 02:41:29,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-28 02:41:29,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-28 02:41:29,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1733#(= main_~i~0 0)} is VALID [2022-04-28 02:41:29,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:29,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:29,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:29,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:29,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:29,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:29,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:29,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:29,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:29,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-28 02:41:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 02:41:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:29,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202204544] [2022-04-28 02:41:29,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202204544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407367800] [2022-04-28 02:41:29,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:29,815 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-28 02:41:29,816 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-28 02:41:29,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:29,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:29,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 02:41:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:29,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:30,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-28 02:41:30,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-28 02:41:30,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-28 02:41:30,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-28 02:41:30,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-28 02:41:30,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-28 02:41:30,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1733#(= main_~i~0 0)} is VALID [2022-04-28 02:41:30,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:30,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:30,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:30,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:30,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:30,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:30,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:30,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1788#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1788#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:30,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-28 02:41:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 02:41:30,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-28 02:41:30,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-28 02:41:30,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-28 02:41:30,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1900#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:30,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:30,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-28 02:41:30,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-28 02:41:30,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-28 02:41:30,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-28 02:41:30,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-28 02:41:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 02:41:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407367800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:30,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:30,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:41:30,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:30,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735642385] [2022-04-28 02:41:30,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735642385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:30,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:30,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588561869] [2022-04-28 02:41:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 35 [2022-04-28 02:41:30,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:30,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-28 02:41:30,319 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-28 02:41:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:41:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:41:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:41:30,320 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-28 02:41:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:30,569 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-28 02:41:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:41:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 35 [2022-04-28 02:41:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-28 02:41:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-28 02:41:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-28 02:41:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-28 02:41:30,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-28 02:41:30,606 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-28 02:41:30,607 INFO L225 Difference]: With dead ends: 63 [2022-04-28 02:41:30,607 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 02:41:30,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:41:30,607 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:30,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 02:41:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-04-28 02:41:30,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:30,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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-28 02:41:30,631 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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-28 02:41:30,631 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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-28 02:41:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:30,632 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-28 02:41:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-28 02:41:30,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:30,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:30,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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 44 states. [2022-04-28 02:41:30,633 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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 44 states. [2022-04-28 02:41:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:30,634 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-28 02:41:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-28 02:41:30,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:30,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:30,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:30,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 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-28 02:41:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-28 02:41:30,635 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2022-04-28 02:41:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:30,635 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-28 02:41:30,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-28 02:41:30,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-28 02:41:30,658 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-28 02:41:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 02:41:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 02:41:30,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:30,658 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:30,687 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-28 02:41:30,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:30,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 11 times [2022-04-28 02:41:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:30,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014027742] [2022-04-28 02:41:30,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:30,867 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:30,867 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 12 times [2022-04-28 02:41:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:30,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309007953] [2022-04-28 02:41:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2266#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-28 02:41:31,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-28 02:41:31,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-28 02:41:31,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2266#(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-28 02:41:31,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2266#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-28 02:41:31,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-28 02:41:31,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-28 02:41:31,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-28 02:41:31,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:31,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} ~i~0 := 0; {2255#false} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-28 02:41:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 02:41:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:31,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309007953] [2022-04-28 02:41:31,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309007953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:31,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082953464] [2022-04-28 02:41:31,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:31,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:31,025 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-28 02:41:31,026 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-28 02:41:31,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 02:41:31,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:31,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 02:41:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:31,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-28 02:41:31,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-28 02:41:31,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-28 02:41:31,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-28 02:41:31,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-28 02:41:31,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:31,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:31,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2318#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:31,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(< (mod main_~i~0 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2322#(< (mod (+ main_~i~0 4294967295) 4294967296) 102400)} is VALID [2022-04-28 02:41:31,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {2322#(< (mod (+ main_~i~0 4294967295) 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2254#true} is VALID [2022-04-28 02:41:31,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#true} ~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {2259#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2259#(= main_~i~0 0)} is VALID [2022-04-28 02:41:31,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {2259#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:31,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:31,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:31,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:31,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:31,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:31,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:31,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2383#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:31,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {2383#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-28 02:41:31,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-28 02:41:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:31,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:32,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-28 02:41:32,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {2318#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-28 02:41:32,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2318#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:32,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:32,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {2403#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:32,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2403#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:32,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:32,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:32,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#true} ~i~0 := 0; {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#true} assume !(~i~0 % 4294967296 < 102400); {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-28 02:41:32,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-28 02:41:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 02:41:32,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082953464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:32,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:32,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 20 [2022-04-28 02:41:32,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:32,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014027742] [2022-04-28 02:41:32,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014027742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:32,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:32,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:41:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833021455] [2022-04-28 02:41:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:32,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 40 [2022-04-28 02:41:32,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:32,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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-28 02:41:32,463 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-28 02:41:32,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:41:32,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:32,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:41:32,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:41:32,464 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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-28 02:41:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,853 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 02:41:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:41:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 40 [2022-04-28 02:41:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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-28 02:41:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 02:41:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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-28 02:41:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 02:41:32,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 02:41:32,895 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-28 02:41:32,896 INFO L225 Difference]: With dead ends: 71 [2022-04-28 02:41:32,896 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 02:41:32,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:41:32,896 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:32,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 02:41:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-28 02:41:32,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:32,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-28 02:41:32,932 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-28 02:41:32,932 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-28 02:41:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,933 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-28 02:41:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-28 02:41:32,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 49 states. [2022-04-28 02:41:32,934 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 49 states. [2022-04-28 02:41:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,935 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-28 02:41:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-28 02:41:32,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:32,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-28 02:41:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-04-28 02:41:32,936 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2022-04-28 02:41:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:32,936 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-04-28 02:41:32,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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-28 02:41:32,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 47 transitions. [2022-04-28 02:41:32,968 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-28 02:41:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-04-28 02:41:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 02:41:32,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:32,969 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:32,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:33,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 13 times [2022-04-28 02:41:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:33,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238272617] [2022-04-28 02:41:33,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:33,182 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:33,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:33,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 14 times [2022-04-28 02:41:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:33,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426927034] [2022-04-28 02:41:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:33,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {2863#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-28 02:41:33,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-28 02:41:33,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-28 02:41:33,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2863#(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-28 02:41:33,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2863#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-28 02:41:33,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-28 02:41:33,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-28 02:41:33,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-28 02:41:33,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2855#(= main_~i~0 0)} is VALID [2022-04-28 02:41:33,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2855#(= main_~i~0 0)} is VALID [2022-04-28 02:41:33,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:33,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:33,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:33,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:33,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:33,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:33,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:33,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:33,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:33,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:33,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:33,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:33,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2862#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:33,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {2862#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-28 02:41:33,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {2851#false} ~i~0 := 0; {2851#false} is VALID [2022-04-28 02:41:33,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {2851#false} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-28 02:41:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 02:41:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:33,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426927034] [2022-04-28 02:41:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426927034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:33,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110669015] [2022-04-28 02:41:33,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:33,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:33,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:33,320 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-28 02:41:33,321 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-28 02:41:33,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:33,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:33,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:41:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:33,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2850#true} is VALID [2022-04-28 02:41:33,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-28 02:41:33,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#true} assume !(~i~0 % 4294967296 < 102400); {2850#true} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#true} ~i~0 := 0; {2855#(= main_~i~0 0)} is VALID [2022-04-28 02:41:33,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2855#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2855#(= main_~i~0 0)} is VALID [2022-04-28 02:41:33,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {2855#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2855#(= main_~i~0 0)} is VALID [2022-04-28 02:41:33,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2855#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:33,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:33,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:33,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:33,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:33,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:33,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:33,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:33,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:33,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:33,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:33,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:33,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:33,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:33,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:33,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:33,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:33,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:33,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2993#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:33,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {2993#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-28 02:41:33,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-28 02:41:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 02:41:33,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:33,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-28 02:41:33,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {3003#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-28 02:41:33,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3003#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:33,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#true} ~i~0 := 0; {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#true} assume !(~i~0 % 4294967296 < 102400); {2850#true} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-28 02:41:33,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-28 02:41:33,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-28 02:41:33,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2850#true} is VALID [2022-04-28 02:41:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 02:41:33,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110669015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:33,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:33,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 02:41:33,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:33,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238272617] [2022-04-28 02:41:33,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238272617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:33,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:33,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:41:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735326016] [2022-04-28 02:41:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:33,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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 45 [2022-04-28 02:41:33,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:33,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-28 02:41:33,942 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-28 02:41:33,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:41:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:41:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:41:33,943 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-28 02:41:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,408 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-28 02:41:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:41:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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 45 [2022-04-28 02:41:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-28 02:41:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-28 02:41:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-28 02:41:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-28 02:41:34,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2022-04-28 02:41:34,453 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-28 02:41:34,454 INFO L225 Difference]: With dead ends: 79 [2022-04-28 02:41:34,454 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 02:41:34,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:41:34,455 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:34,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:41:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 02:41:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-04-28 02:41:34,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:34,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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-28 02:41:34,491 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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-28 02:41:34,491 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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-28 02:41:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,492 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-28 02:41:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-28 02:41:34,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:34,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:34,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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 54 states. [2022-04-28 02:41:34,493 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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 54 states. [2022-04-28 02:41:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,494 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-28 02:41:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-28 02:41:34,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:34,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:34,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:34,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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-28 02:41:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-28 02:41:34,495 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2022-04-28 02:41:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:34,495 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-28 02:41:34,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-28 02:41:34,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-28 02:41:34,535 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-28 02:41:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-28 02:41:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 02:41:34,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:34,535 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:34,555 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-28 02:41:34,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:34,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 15 times [2022-04-28 02:41:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:34,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321593874] [2022-04-28 02:41:34,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:34,757 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:34,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 16 times [2022-04-28 02:41:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:34,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100877023] [2022-04-28 02:41:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:34,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {3526#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-28 02:41:34,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-28 02:41:34,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-28 02:41:34,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3526#(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-28 02:41:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-28 02:41:34,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-28 02:41:34,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-28 02:41:34,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-28 02:41:34,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3517#(= main_~i~0 0)} is VALID [2022-04-28 02:41:34,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {3517#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3517#(= main_~i~0 0)} is VALID [2022-04-28 02:41:34,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:34,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:34,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:34,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:34,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:34,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:34,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:34,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:34,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:34,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:34,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:34,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:34,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:34,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:34,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3525#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {3525#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {3513#false} ~i~0 := 0; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-28 02:41:34,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {3513#false} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-28 02:41:34,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-28 02:41:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 02:41:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100877023] [2022-04-28 02:41:34,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100877023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148604723] [2022-04-28 02:41:34,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:34,926 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-28 02:41:34,939 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-28 02:41:35,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:35,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:35,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 02:41:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:35,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:35,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-28 02:41:35,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#true} assume !(~i~0 % 4294967296 < 102400); {3512#true} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#true} ~i~0 := 0; {3517#(= main_~i~0 0)} is VALID [2022-04-28 02:41:35,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {3517#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3517#(= main_~i~0 0)} is VALID [2022-04-28 02:41:35,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3517#(= main_~i~0 0)} is VALID [2022-04-28 02:41:35,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:35,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:35,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:35,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:35,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:35,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:35,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:35,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:35,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:35,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:35,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:35,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:35,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:35,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:35,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:35,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:35,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:35,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:35,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:35,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:35,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:35,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3671#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:35,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {3671#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-28 02:41:35,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-28 02:41:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 02:41:35,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:35,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-28 02:41:35,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {3681#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-28 02:41:35,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3681#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:35,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#true} ~i~0 := 0; {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#true} assume !(~i~0 % 4294967296 < 102400); {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-28 02:41:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 02:41:35,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148604723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:35,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:35,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 02:41:35,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:35,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321593874] [2022-04-28 02:41:35,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321593874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:35,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:35,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:41:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258533582] [2022-04-28 02:41:35,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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 50 [2022-04-28 02:41:35,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:35,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-28 02:41:35,691 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-28 02:41:35,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:41:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:41:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:41:35,692 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-28 02:41:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:36,296 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-28 02:41:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:41:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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 50 [2022-04-28 02:41:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-28 02:41:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-28 02:41:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-28 02:41:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-28 02:41:36,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-04-28 02:41:36,351 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-28 02:41:36,352 INFO L225 Difference]: With dead ends: 87 [2022-04-28 02:41:36,352 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 02:41:36,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:41:36,353 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:36,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:41:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 02:41:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-04-28 02:41:36,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:36,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-28 02:41:36,401 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-28 02:41:36,401 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-28 02:41:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:36,402 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-28 02:41:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-28 02:41:36,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:36,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:36,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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 59 states. [2022-04-28 02:41:36,402 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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 59 states. [2022-04-28 02:41:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:36,403 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-28 02:41:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-28 02:41:36,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:36,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:36,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:36,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-28 02:41:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-04-28 02:41:36,404 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-04-28 02:41:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:36,405 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-04-28 02:41:36,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-28 02:41:36,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2022-04-28 02:41:36,441 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-28 02:41:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-28 02:41:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 02:41:36,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:36,441 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:36,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:36,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 02:41:36,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 17 times [2022-04-28 02:41:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:36,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1224546767] [2022-04-28 02:41:36,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:36,667 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:36,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 18 times [2022-04-28 02:41:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:36,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138652175] [2022-04-28 02:41:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {4257#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-28 02:41:36,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-28 02:41:36,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-28 02:41:36,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4257#(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-28 02:41:36,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {4257#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-28 02:41:36,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-28 02:41:36,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-28 02:41:36,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-28 02:41:36,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4247#(= main_~i~0 0)} is VALID [2022-04-28 02:41:36,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4247#(= main_~i~0 0)} is VALID [2022-04-28 02:41:36,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:36,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:36,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:36,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:36,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:36,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:36,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:36,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:36,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:36,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:36,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:36,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:36,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:36,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:36,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:36,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:36,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4256#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {4256#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-28 02:41:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 02:41:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138652175] [2022-04-28 02:41:36,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138652175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519373055] [2022-04-28 02:41:36,860 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:36,876 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-28 02:41:36,923 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-28 02:41:37,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 02:41:37,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:37,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:41:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:37,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:37,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4242#true} is VALID [2022-04-28 02:41:37,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-28 02:41:37,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-28 02:41:37,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-28 02:41:37,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-28 02:41:37,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4247#(= main_~i~0 0)} is VALID [2022-04-28 02:41:37,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4247#(= main_~i~0 0)} is VALID [2022-04-28 02:41:37,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:37,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:37,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:37,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:37,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:37,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:37,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:37,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:37,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:37,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:37,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:37,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:37,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:37,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:37,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:37,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:37,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4330#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:37,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {4330#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:37,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:37,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:38,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-28 02:41:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 02:41:38,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-28 02:41:38,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-28 02:41:38,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4514#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-28 02:41:38,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4514#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:38,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:38,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-28 02:41:38,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-28 02:41:38,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-28 02:41:38,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-28 02:41:38,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4242#true} is VALID [2022-04-28 02:41:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 02:41:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519373055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:38,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 02:41:38,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1224546767] [2022-04-28 02:41:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1224546767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:38,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:38,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:41:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713881036] [2022-04-28 02:41:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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 55 [2022-04-28 02:41:38,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:38,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-28 02:41:38,340 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-28 02:41:38,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:41:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:41:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:41:38,342 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-28 02:41:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,970 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-28 02:41:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:41:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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 55 [2022-04-28 02:41:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-28 02:41:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-28 02:41:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-28 02:41:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-28 02:41:38,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-28 02:41:39,024 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-28 02:41:39,025 INFO L225 Difference]: With dead ends: 95 [2022-04-28 02:41:39,025 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 02:41:39,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:41:39,026 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:39,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 113 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:41:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 02:41:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-04-28 02:41:39,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:39,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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-28 02:41:39,074 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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-28 02:41:39,074 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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-28 02:41:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:39,075 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-28 02:41:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-28 02:41:39,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:39,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:39,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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 64 states. [2022-04-28 02:41:39,076 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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 64 states. [2022-04-28 02:41:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:39,077 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-28 02:41:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-28 02:41:39,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:39,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:39,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:39,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 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-28 02:41:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-28 02:41:39,078 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2022-04-28 02:41:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:39,078 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-28 02:41:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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-28 02:41:39,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-28 02:41:39,131 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-28 02:41:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 02:41:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 02:41:39,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:39,132 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:39,136 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-28 02:41:39,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:39,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 19 times [2022-04-28 02:41:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176786317] [2022-04-28 02:41:39,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:39,343 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:39,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 20 times [2022-04-28 02:41:39,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:39,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939668522] [2022-04-28 02:41:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {5056#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-28 02:41:39,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-28 02:41:39,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-28 02:41:39,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5056#(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-28 02:41:39,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {5056#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-28 02:41:39,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-28 02:41:39,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-28 02:41:39,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-28 02:41:39,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5045#(= main_~i~0 0)} is VALID [2022-04-28 02:41:39,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {5045#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5045#(= main_~i~0 0)} is VALID [2022-04-28 02:41:39,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {5045#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:39,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:39,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:39,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:39,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:39,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:39,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:39,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:39,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:39,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:39,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:39,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:39,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:39,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:39,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:39,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:39,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:39,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:39,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5055#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {5055#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-28 02:41:39,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {5041#false} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-28 02:41:39,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-28 02:41:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 02:41:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939668522] [2022-04-28 02:41:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939668522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84390931] [2022-04-28 02:41:39,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:39,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:39,575 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-28 02:41:39,587 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-28 02:41:39,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:39,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:39,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:41:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:40,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2022-04-28 02:41:40,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-28 02:41:40,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-28 02:41:40,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-28 02:41:40,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-28 02:41:40,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {5040#true} assume !(~i~0 % 4294967296 < 102400); {5040#true} is VALID [2022-04-28 02:41:40,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {5040#true} ~i~0 := 0; {5045#(= main_~i~0 0)} is VALID [2022-04-28 02:41:40,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {5045#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5045#(= main_~i~0 0)} is VALID [2022-04-28 02:41:40,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {5045#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5045#(= main_~i~0 0)} is VALID [2022-04-28 02:41:40,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {5045#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:40,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:40,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:40,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:40,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:40,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:40,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:40,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:40,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:40,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:40,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:40,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:40,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:40,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:40,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:40,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:40,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:40,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:40,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:40,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:40,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:40,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:40,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:40,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:40,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:40,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:40,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:40,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5231#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:40,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {5231#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-28 02:41:40,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-28 02:41:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 02:41:40,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:40,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-28 02:41:40,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {5241#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-28 02:41:40,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5241#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:40,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {5040#true} ~i~0 := 0; {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {5040#true} assume !(~i~0 % 4294967296 < 102400); {5040#true} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2022-04-28 02:41:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 02:41:40,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84390931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:40,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:40,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 02:41:40,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:40,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176786317] [2022-04-28 02:41:40,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176786317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:40,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:40,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:41:40,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938706309] [2022-04-28 02:41:40,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:40,434 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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 60 [2022-04-28 02:41:40,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:40,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-28 02:41:40,456 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-28 02:41:40,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:41:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:41:40,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-28 02:41:40,457 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-28 02:41:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,195 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-28 02:41:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 02:41:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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 60 [2022-04-28 02:41:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-28 02:41:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-28 02:41:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-28 02:41:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-28 02:41:41,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2022-04-28 02:41:41,251 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-28 02:41:41,252 INFO L225 Difference]: With dead ends: 103 [2022-04-28 02:41:41,252 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 02:41:41,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2022-04-28 02:41:41,252 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:41,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 142 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:41:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 02:41:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-04-28 02:41:41,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:41,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-28 02:41:41,304 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-28 02:41:41,304 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-28 02:41:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,305 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 02:41:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 02:41:41,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:41,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:41,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 69 states. [2022-04-28 02:41:41,306 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 69 states. [2022-04-28 02:41:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,307 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 02:41:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 02:41:41,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:41,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:41,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:41,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-28 02:41:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-04-28 02:41:41,308 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2022-04-28 02:41:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:41,308 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-04-28 02:41:41,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-28 02:41:41,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 67 transitions. [2022-04-28 02:41:41,353 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-28 02:41:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-04-28 02:41:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 02:41:41,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:41,353 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:41,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 02:41:41,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 02:41:41,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 21 times [2022-04-28 02:41:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804921926] [2022-04-28 02:41:41,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:41,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:41,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 22 times [2022-04-28 02:41:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164125758] [2022-04-28 02:41:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:41,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-28 02:41:41,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-28 02:41:41,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-28 02:41:41,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5923#(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-28 02:41:41,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-28 02:41:41,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-28 02:41:41,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-28 02:41:41,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-28 02:41:41,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5911#(= main_~i~0 0)} is VALID [2022-04-28 02:41:41,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {5911#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5911#(= main_~i~0 0)} is VALID [2022-04-28 02:41:41,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {5911#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:41,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:41,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:41,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:41,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:41,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:41,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:41,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:41,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:41,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:41,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:41,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:41,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:41,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:41,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:41,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:41,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:41,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:41,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:41,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:41,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5922#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {5922#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {5907#false} ~i~0 := 0; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {5907#false} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-28 02:41:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-04-28 02:41:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:41,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164125758] [2022-04-28 02:41:41,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164125758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921295759] [2022-04-28 02:41:41,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:41,807 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-28 02:41:41,808 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-28 02:41:41,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:41,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:41,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:41:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:42,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:42,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5906#true} is VALID [2022-04-28 02:41:42,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-28 02:41:42,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-28 02:41:42,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#true} assume !(~i~0 % 4294967296 < 102400); {5906#true} is VALID [2022-04-28 02:41:42,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#true} ~i~0 := 0; {5911#(= main_~i~0 0)} is VALID [2022-04-28 02:41:42,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {5911#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5911#(= main_~i~0 0)} is VALID [2022-04-28 02:41:42,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {5911#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5911#(= main_~i~0 0)} is VALID [2022-04-28 02:41:42,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {5911#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:42,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:42,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:42,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:42,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:42,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:42,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:42,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:42,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:42,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:42,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:42,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:42,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:42,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:42,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:42,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:42,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:42,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:42,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:42,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:42,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:42,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:42,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:42,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:42,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:42,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:42,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:42,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:42,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:42,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:42,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6113#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:42,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {6113#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-28 02:41:42,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-28 02:41:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 02:41:42,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:42,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-28 02:41:42,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {6123#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-28 02:41:42,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6123#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:42,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#true} ~i~0 := 0; {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:42,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#true} assume !(~i~0 % 4294967296 < 102400); {5906#true} is VALID [2022-04-28 02:41:42,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-28 02:41:42,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5906#true} is VALID [2022-04-28 02:41:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 02:41:42,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921295759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:42,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:42,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 02:41:42,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:42,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804921926] [2022-04-28 02:41:42,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804921926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:42,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:42,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 02:41:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763842119] [2022-04-28 02:41:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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 65 [2022-04-28 02:41:42,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:42,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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-28 02:41:42,847 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-28 02:41:42,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 02:41:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 02:41:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:41:42,848 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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-28 02:41:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,743 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-28 02:41:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 02:41:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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 65 [2022-04-28 02:41:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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-28 02:41:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-28 02:41:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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-28 02:41:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-28 02:41:43,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2022-04-28 02:41:43,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,800 INFO L225 Difference]: With dead ends: 111 [2022-04-28 02:41:43,800 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 02:41:43,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2022-04-28 02:41:43,801 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:43,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:41:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 02:41:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-28 02:41:43,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:43,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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-28 02:41:43,894 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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-28 02:41:43,894 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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-28 02:41:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,895 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-28 02:41:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-28 02:41:43,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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 74 states. [2022-04-28 02:41:43,896 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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 74 states. [2022-04-28 02:41:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,896 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-28 02:41:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-28 02:41:43,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:43,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 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-28 02:41:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-28 02:41:43,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2022-04-28 02:41:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:43,898 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-28 02:41:43,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 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-28 02:41:43,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-28 02:41:43,945 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-28 02:41:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-28 02:41:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 02:41:43,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:43,945 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:43,961 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-28 02:41:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 02:41:44,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 23 times [2022-04-28 02:41:44,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:44,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838720286] [2022-04-28 02:41:44,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:44,155 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:44,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 24 times [2022-04-28 02:41:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:44,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986104699] [2022-04-28 02:41:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:44,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {6858#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-28 02:41:44,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 02:41:44,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-28 02:41:44,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6858#(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-28 02:41:44,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {6858#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-28 02:41:44,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 02:41:44,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-28 02:41:44,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-28 02:41:44,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6845#(= main_~i~0 0)} is VALID [2022-04-28 02:41:44,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {6845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6845#(= main_~i~0 0)} is VALID [2022-04-28 02:41:44,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {6845#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:44,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:44,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:44,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:44,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:44,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:44,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:44,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:44,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:44,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:44,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:44,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:44,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:44,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:44,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:44,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:44,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:44,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:44,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:44,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:44,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:44,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:44,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6857#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:44,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {6857#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-28 02:41:44,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {6841#false} ~i~0 := 0; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 50: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 51: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {6841#false} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 02:41:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 02:41:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986104699] [2022-04-28 02:41:44,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986104699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547918560] [2022-04-28 02:41:44,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:44,417 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-28 02:41:44,418 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-28 02:41:52,007 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 02:41:52,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:52,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 02:41:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:52,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:52,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#true} assume !(~i~0 % 4294967296 < 102400); {6840#true} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#true} ~i~0 := 0; {6845#(= main_~i~0 0)} is VALID [2022-04-28 02:41:52,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {6845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6845#(= main_~i~0 0)} is VALID [2022-04-28 02:41:52,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {6845#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6845#(= main_~i~0 0)} is VALID [2022-04-28 02:41:52,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {6845#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:52,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:52,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:52,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:52,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:52,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:52,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:52,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:52,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:52,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:52,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:52,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:52,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:52,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:52,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:52,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:52,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:52,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:52,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:52,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:52,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:52,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:52,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:52,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:52,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:52,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:52,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:52,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:52,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:52,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:52,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:52,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:52,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:52,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7063#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:52,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {7063#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-28 02:41:52,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 02:41:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 02:41:52,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:53,358 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 02:41:53,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {7073#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-28 02:41:53,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7073#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:53,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:53,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {7084#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:53,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7084#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-28 02:41:53,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#true} ~i~0 := 0; {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#true} assume !(~i~0 % 4294967296 < 102400); {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-28 02:41:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 02:41:53,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547918560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:53,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:53,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31 [2022-04-28 02:41:53,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:53,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838720286] [2022-04-28 02:41:53,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838720286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:53,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:53,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:41:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481028191] [2022-04-28 02:41:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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 70 [2022-04-28 02:41:53,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:53,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:41:53,404 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-28 02:41:53,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:41:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:41:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2022-04-28 02:41:53,404 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:41:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:54,430 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-28 02:41:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:41:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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 70 [2022-04-28 02:41:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:41:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-28 02:41:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:41:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-28 02:41:54,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 88 transitions. [2022-04-28 02:41:54,491 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-28 02:41:54,492 INFO L225 Difference]: With dead ends: 119 [2022-04-28 02:41:54,492 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 02:41:54,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:41:54,493 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:54,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 191 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:41:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 02:41:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-28 02:41:54,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:54,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-28 02:41:54,548 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-28 02:41:54,548 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-28 02:41:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:54,549 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-28 02:41:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-28 02:41:54,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:54,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:54,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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 79 states. [2022-04-28 02:41:54,550 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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 79 states. [2022-04-28 02:41:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:54,551 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-28 02:41:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-28 02:41:54,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:54,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:54,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:54,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-28 02:41:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-04-28 02:41:54,552 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2022-04-28 02:41:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:54,552 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-04-28 02:41:54,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:41:54,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 77 transitions. [2022-04-28 02:41:54,620 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-28 02:41:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-04-28 02:41:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 02:41:54,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:54,620 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:54,626 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-28 02:41:54,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 02:41:54,821 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 25 times [2022-04-28 02:41:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:54,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458357894] [2022-04-28 02:41:54,829 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:54,829 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:54,829 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 26 times [2022-04-28 02:41:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:54,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654884517] [2022-04-28 02:41:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:55,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {7862#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-28 02:41:55,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-28 02:41:55,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-28 02:41:55,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7862#(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-28 02:41:55,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {7862#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-28 02:41:55,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-28 02:41:55,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-28 02:41:55,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-28 02:41:55,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7848#(= main_~i~0 0)} is VALID [2022-04-28 02:41:55,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {7848#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7848#(= main_~i~0 0)} is VALID [2022-04-28 02:41:55,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {7848#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:55,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:55,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:55,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:55,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:55,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:55,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:55,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:55,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:55,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:55,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:55,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:55,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:55,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:55,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:55,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:55,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:55,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:55,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:55,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:55,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:55,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7861#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {7861#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {7844#false} ~i~0 := 0; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 64: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-28 02:41:55,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-28 02:41:55,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-28 02:41:55,132 INFO L290 TraceCheckUtils]: 73: Hoare triple {7844#false} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-28 02:41:55,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-28 02:41:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-04-28 02:41:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:55,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654884517] [2022-04-28 02:41:55,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654884517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:55,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218820085] [2022-04-28 02:41:55,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:55,135 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-28 02:41:55,136 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-28 02:41:55,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:55,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:55,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 02:41:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:55,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:55,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {7843#true} assume !(~i~0 % 4294967296 < 102400); {7843#true} is VALID [2022-04-28 02:41:55,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {7843#true} ~i~0 := 0; {7848#(= main_~i~0 0)} is VALID [2022-04-28 02:41:55,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {7848#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7848#(= main_~i~0 0)} is VALID [2022-04-28 02:41:55,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {7848#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7848#(= main_~i~0 0)} is VALID [2022-04-28 02:41:55,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {7848#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:55,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:55,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:55,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:55,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:55,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:55,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:55,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:55,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:55,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:55,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:55,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:55,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:55,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:55,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:55,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:55,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:55,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:55,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:55,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:55,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:55,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:55,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:55,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:55,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:55,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:55,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:55,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:55,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:55,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:55,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:55,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:55,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:55,830 INFO L290 TraceCheckUtils]: 69: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:55,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:55,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:55,831 INFO L290 TraceCheckUtils]: 72: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8082#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:41:55,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {8082#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-28 02:41:55,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-28 02:41:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-28 02:41:55,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:56,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-28 02:41:56,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {8092#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-28 02:41:56,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8092#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:56,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,325 INFO L290 TraceCheckUtils]: 65: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,325 INFO L290 TraceCheckUtils]: 64: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {7843#true} ~i~0 := 0; {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {7843#true} assume !(~i~0 % 4294967296 < 102400); {7843#true} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-28 02:41:56,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7843#true} is VALID [2022-04-28 02:41:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-28 02:41:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218820085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:56,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:56,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 02:41:56,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458357894] [2022-04-28 02:41:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458357894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:56,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:56,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:41:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679461105] [2022-04-28 02:41:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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 75 [2022-04-28 02:41:56,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:56,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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-28 02:41:56,383 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-28 02:41:56,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:41:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:41:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:41:56,385 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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-28 02:41:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:57,533 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-28 02:41:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:41:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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 75 [2022-04-28 02:41:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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-28 02:41:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-28 02:41:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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-28 02:41:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-28 02:41:57,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2022-04-28 02:41:57,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:57,611 INFO L225 Difference]: With dead ends: 127 [2022-04-28 02:41:57,612 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 02:41:57,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 02:41:57,612 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:57,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 236 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:41:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 02:41:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-04-28 02:41:57,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:57,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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-28 02:41:57,678 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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-28 02:41:57,678 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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-28 02:41:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:57,679 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-28 02:41:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-28 02:41:57,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:57,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:57,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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 84 states. [2022-04-28 02:41:57,679 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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 84 states. [2022-04-28 02:41:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:57,680 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-28 02:41:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-28 02:41:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:57,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:57,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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-28 02:41:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-04-28 02:41:57,682 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-04-28 02:41:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:57,682 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-04-28 02:41:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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-28 02:41:57,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 82 transitions. [2022-04-28 02:41:57,737 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-28 02:41:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-28 02:41:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 02:41:57,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:57,738 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:57,755 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-28 02:41:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 02:41:57,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 27 times [2022-04-28 02:41:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:57,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010627453] [2022-04-28 02:41:57,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:57,961 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:57,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 28 times [2022-04-28 02:41:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:57,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895714823] [2022-04-28 02:41:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:58,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {8933#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-28 02:41:58,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-28 02:41:58,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-28 02:41:58,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8933#(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-28 02:41:58,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {8933#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-28 02:41:58,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-28 02:41:58,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-28 02:41:58,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-28 02:41:58,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {8918#(= main_~i~0 0)} is VALID [2022-04-28 02:41:58,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {8918#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8918#(= main_~i~0 0)} is VALID [2022-04-28 02:41:58,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {8918#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:58,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:58,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:58,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:58,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:58,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:58,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:58,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:58,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:58,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:58,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:58,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:58,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:58,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:58,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:58,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:58,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:58,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:58,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:58,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:58,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:58,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:58,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:58,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:58,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:41:58,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8932#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {8932#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:58,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-28 02:41:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-28 02:41:58,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:58,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895714823] [2022-04-28 02:41:58,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895714823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:58,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724207858] [2022-04-28 02:41:58,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:58,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:58,239 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-28 02:41:58,239 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-28 02:41:58,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:58,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:58,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 02:41:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:58,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:58,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8913#true} is VALID [2022-04-28 02:41:58,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-28 02:41:58,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-28 02:41:58,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-28 02:41:58,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-28 02:41:58,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {8918#(= main_~i~0 0)} is VALID [2022-04-28 02:41:58,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {8918#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8918#(= main_~i~0 0)} is VALID [2022-04-28 02:41:58,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {8918#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:58,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:41:58,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:58,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:41:58,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:58,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:41:58,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:58,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:41:58,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:58,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:41:58,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:58,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:41:58,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:58,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:41:58,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:58,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:41:58,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:58,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:41:58,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:58,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:41:58,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:58,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:41:58,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:58,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:41:58,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:41:58,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:41:58,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9036#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {9036#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-28 02:41:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-28 02:41:58,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,374 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-28 02:41:59,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {9310#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-28 02:41:59,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9310#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:41:59,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:41:59,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-28 02:41:59,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-28 02:41:59,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-28 02:41:59,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-28 02:41:59,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8913#true} is VALID [2022-04-28 02:41:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-28 02:41:59,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724207858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:59,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:59,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 02:41:59,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:59,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010627453] [2022-04-28 02:41:59,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010627453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:59,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:59,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:41:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818919921] [2022-04-28 02:41:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:59,395 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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 80 [2022-04-28 02:41:59,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:59,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-28 02:41:59,423 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-28 02:41:59,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:41:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:41:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:41:59,424 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-28 02:42:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:00,706 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-28 02:42:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 02:42:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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 80 [2022-04-28 02:42:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-28 02:42:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 02:42:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-28 02:42:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 02:42:00,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-28 02:42:00,773 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-28 02:42:00,774 INFO L225 Difference]: With dead ends: 135 [2022-04-28 02:42:00,774 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 02:42:00,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 02:42:00,774 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:00,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:42:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 02:42:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-04-28 02:42:00,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:00,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-28 02:42:00,862 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-28 02:42:00,862 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-28 02:42:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:00,863 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-28 02:42:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-28 02:42:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:00,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:00,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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 89 states. [2022-04-28 02:42:00,863 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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 89 states. [2022-04-28 02:42:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:00,864 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-28 02:42:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-28 02:42:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:00,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:00,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:00,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-28 02:42:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-04-28 02:42:00,866 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2022-04-28 02:42:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:00,866 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-04-28 02:42:00,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-28 02:42:00,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 87 transitions. [2022-04-28 02:42:00,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-28 02:42:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 02:42:00,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:00,923 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:00,940 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-28 02:42:01,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:01,124 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 29 times [2022-04-28 02:42:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:01,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323229568] [2022-04-28 02:42:01,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:01,133 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:01,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 30 times [2022-04-28 02:42:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:01,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576966080] [2022-04-28 02:42:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:01,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {10072#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10072#(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-28 02:42:01,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {10072#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-28 02:42:01,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-28 02:42:01,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10056#(= main_~i~0 0)} is VALID [2022-04-28 02:42:01,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {10056#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10056#(= main_~i~0 0)} is VALID [2022-04-28 02:42:01,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {10056#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:01,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:01,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:01,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:01,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:01,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:01,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:01,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:01,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:01,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:01,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:01,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:01,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:01,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:01,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:01,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:01,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:01,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:01,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:01,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:01,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:01,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:01,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:01,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:01,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:01,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:01,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:01,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10071#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {10071#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:01,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-28 02:42:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-28 02:42:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576966080] [2022-04-28 02:42:01,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576966080] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315982648] [2022-04-28 02:42:01,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:42:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:01,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:01,444 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-28 02:42:01,445 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-28 02:42:26,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 02:42:26,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:26,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 02:42:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:26,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:26,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10051#true} is VALID [2022-04-28 02:42:26,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-28 02:42:26,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-28 02:42:26,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-28 02:42:26,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-28 02:42:26,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10056#(= main_~i~0 0)} is VALID [2022-04-28 02:42:26,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {10056#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10056#(= main_~i~0 0)} is VALID [2022-04-28 02:42:26,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {10056#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:26,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:26,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:26,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:26,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:26,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:26,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:26,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:26,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:26,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:26,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:26,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:26,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:26,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:26,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:26,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:26,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:26,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:26,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:26,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:26,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:26,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:26,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:26,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:26,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:26,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:26,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:26,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:26,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10181#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:26,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {10181#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:26,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-28 02:42:26,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-28 02:42:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-28 02:42:26,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:27,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-28 02:42:27,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {10473#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-28 02:42:27,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10473#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:42:27,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:27,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-28 02:42:27,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-28 02:42:27,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-28 02:42:27,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-28 02:42:27,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10051#true} is VALID [2022-04-28 02:42:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-28 02:42:27,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315982648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:27,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:27,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 02:42:27,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323229568] [2022-04-28 02:42:27,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323229568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:27,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:27,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:42:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725416071] [2022-04-28 02:42:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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 85 [2022-04-28 02:42:27,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:27,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-28 02:42:27,122 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-28 02:42:27,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:42:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:42:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:42:27,123 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-28 02:42:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,548 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-28 02:42:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:42:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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 85 [2022-04-28 02:42:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-28 02:42:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-28 02:42:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-28 02:42:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-28 02:42:28,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-28 02:42:28,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:28,621 INFO L225 Difference]: With dead ends: 143 [2022-04-28 02:42:28,621 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 02:42:28,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=954, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:42:28,622 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:28,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 02:42:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 02:42:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 02:42:28,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:28,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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-28 02:42:28,693 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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-28 02:42:28,694 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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-28 02:42:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,695 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-28 02:42:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-28 02:42:28,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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 94 states. [2022-04-28 02:42:28,695 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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 94 states. [2022-04-28 02:42:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,696 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-28 02:42:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-28 02:42:28,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:28,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 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-28 02:42:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-28 02:42:28,698 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2022-04-28 02:42:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:28,698 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-28 02:42:28,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 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-28 02:42:28,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-28 02:42:28,767 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-28 02:42:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-28 02:42:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 02:42:28,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:28,768 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:28,778 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-28 02:42:28,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 02:42:28,977 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 31 times [2022-04-28 02:42:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995910042] [2022-04-28 02:42:28,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:28,991 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:28,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 32 times [2022-04-28 02:42:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:28,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928966849] [2022-04-28 02:42:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:29,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {11279#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-28 02:42:29,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-28 02:42:29,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-28 02:42:29,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11279#(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-28 02:42:29,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {11279#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-28 02:42:29,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-28 02:42:29,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-28 02:42:29,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-28 02:42:29,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11262#(= main_~i~0 0)} is VALID [2022-04-28 02:42:29,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {11262#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11262#(= main_~i~0 0)} is VALID [2022-04-28 02:42:29,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {11262#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:29,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:29,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:29,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:29,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:29,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:29,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:29,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:29,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:29,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:29,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:29,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:29,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:29,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:29,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:29,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:29,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:29,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:29,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:29,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:29,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:29,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:29,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:29,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:29,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:29,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:29,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:29,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:29,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:29,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:29,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11278#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {11278#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {11258#false} ~i~0 := 0; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 71: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 72: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 73: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 74: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 75: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 76: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 77: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 84: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 85: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 87: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {11258#false} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-28 02:42:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-04-28 02:42:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:29,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928966849] [2022-04-28 02:42:29,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928966849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:29,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999710146] [2022-04-28 02:42:29,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:29,338 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-28 02:42:29,338 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-28 02:42:30,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:30,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:30,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 02:42:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:30,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:30,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11257#true} is VALID [2022-04-28 02:42:30,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-28 02:42:30,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-28 02:42:30,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-28 02:42:30,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {11257#true} assume !(~i~0 % 4294967296 < 102400); {11257#true} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {11257#true} ~i~0 := 0; {11262#(= main_~i~0 0)} is VALID [2022-04-28 02:42:30,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {11262#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11262#(= main_~i~0 0)} is VALID [2022-04-28 02:42:30,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {11262#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11262#(= main_~i~0 0)} is VALID [2022-04-28 02:42:30,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {11262#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:30,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:30,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:30,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:30,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:30,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:30,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:30,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:30,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:30,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:30,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:30,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:30,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:30,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:30,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:30,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:30,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:30,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:30,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:30,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:30,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:30,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:30,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:30,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:30,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:30,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:30,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:30,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:30,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:30,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:30,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:30,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:30,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:30,540 INFO L290 TraceCheckUtils]: 75: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:30,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:30,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:30,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:30,541 INFO L290 TraceCheckUtils]: 79: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:30,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:30,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:30,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:30,543 INFO L290 TraceCheckUtils]: 83: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:30,543 INFO L290 TraceCheckUtils]: 84: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:30,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:30,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:30,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11544#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:30,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {11544#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-28 02:42:30,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-28 02:42:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-28 02:42:30,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:31,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-28 02:42:31,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {11554#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-28 02:42:31,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11554#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:42:31,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {11257#true} ~i~0 := 0; {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {11257#true} assume !(~i~0 % 4294967296 < 102400); {11257#true} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-28 02:42:31,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-28 02:42:31,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11257#true} is VALID [2022-04-28 02:42:31,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-28 02:42:31,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-28 02:42:31,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-28 02:42:31,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-28 02:42:31,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11257#true} is VALID [2022-04-28 02:42:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-28 02:42:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999710146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:31,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 02:42:31,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995910042] [2022-04-28 02:42:31,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995910042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:31,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:42:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565244517] [2022-04-28 02:42:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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 90 [2022-04-28 02:42:31,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:31,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-28 02:42:31,219 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-28 02:42:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:42:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:31,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:42:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:42:31,219 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-28 02:42:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:32,785 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-28 02:42:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:42:32,785 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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 90 [2022-04-28 02:42:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-28 02:42:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-28 02:42:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-28 02:42:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-28 02:42:32,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2022-04-28 02:42:33,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,083 INFO L225 Difference]: With dead ends: 151 [2022-04-28 02:42:33,083 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 02:42:33,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=1064, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 02:42:33,084 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:33,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 318 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 02:42:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 02:42:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-04-28 02:42:33,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:33,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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-28 02:42:33,168 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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-28 02:42:33,169 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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-28 02:42:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,170 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-28 02:42:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-28 02:42:33,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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 99 states. [2022-04-28 02:42:33,170 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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 99 states. [2022-04-28 02:42:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:33,171 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-28 02:42:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-28 02:42:33,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:33,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:33,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:33,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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-28 02:42:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-04-28 02:42:33,173 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2022-04-28 02:42:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:33,173 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-04-28 02:42:33,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-28 02:42:33,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 97 transitions. [2022-04-28 02:42:33,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-04-28 02:42:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 02:42:33,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:33,249 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:33,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:33,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 02:42:33,450 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 33 times [2022-04-28 02:42:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941221849] [2022-04-28 02:42:33,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:33,458 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:33,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 34 times [2022-04-28 02:42:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:33,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892488246] [2022-04-28 02:42:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {12554#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-28 02:42:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-28 02:42:33,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-28 02:42:33,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12554#(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-28 02:42:33,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-28 02:42:33,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-28 02:42:33,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-28 02:42:33,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-28 02:42:33,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {12536#(= main_~i~0 0)} is VALID [2022-04-28 02:42:33,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {12536#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12536#(= main_~i~0 0)} is VALID [2022-04-28 02:42:33,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {12536#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:33,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:33,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:33,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:33,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:33,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:33,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:33,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:33,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:33,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:33,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:33,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:33,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:33,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:33,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:33,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:33,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:33,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:33,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:33,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:33,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:33,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:33,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:33,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:33,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:33,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:33,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:33,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:33,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:33,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:33,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:33,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:33,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12553#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {12553#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:33,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:33,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-28 02:42:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-28 02:42:33,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892488246] [2022-04-28 02:42:33,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892488246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691761781] [2022-04-28 02:42:33,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:42:33,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:33,790 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-28 02:42:33,819 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-28 02:42:34,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:42:34,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:34,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 02:42:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:34,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:34,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12531#true} is VALID [2022-04-28 02:42:34,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-28 02:42:34,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-28 02:42:34,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-28 02:42:34,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-28 02:42:34,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {12536#(= main_~i~0 0)} is VALID [2022-04-28 02:42:34,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {12536#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12536#(= main_~i~0 0)} is VALID [2022-04-28 02:42:34,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {12536#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:34,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:34,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:34,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:34,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:34,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:34,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:34,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:34,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:34,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:34,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:34,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:34,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:34,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:34,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:34,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:34,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:34,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:34,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:34,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:34,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:34,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:34,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:34,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:34,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:34,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:34,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:34,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:34,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:34,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:34,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:34,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:34,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12675#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {12675#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:34,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:34,888 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-28 02:42:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-28 02:42:34,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:35,593 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-28 02:42:35,593 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:35,593 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-28 02:42:35,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {13003#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-28 02:42:35,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13003#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-28 02:42:35,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-28 02:42:35,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-28 02:42:35,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-28 02:42:35,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12531#true} is VALID [2022-04-28 02:42:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-28 02:42:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691761781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:35,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:35,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 02:42:35,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941221849] [2022-04-28 02:42:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941221849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:35,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:35,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 02:42:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330080079] [2022-04-28 02:42:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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 95 [2022-04-28 02:42:35,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:35,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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-28 02:42:35,644 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-28 02:42:35,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 02:42:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:35,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 02:42:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:42:35,645 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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-28 02:42:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,474 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2022-04-28 02:42:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 02:42:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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 95 [2022-04-28 02:42:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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-28 02:42:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-28 02:42:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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-28 02:42:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-28 02:42:37,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 113 transitions. [2022-04-28 02:42:37,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,564 INFO L225 Difference]: With dead ends: 159 [2022-04-28 02:42:37,564 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 02:42:37,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 02:42:37,565 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:37,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 366 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 02:42:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 02:42:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2022-04-28 02:42:37,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:37,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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-28 02:42:37,652 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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-28 02:42:37,652 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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-28 02:42:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,653 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-28 02:42:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-28 02:42:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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 104 states. [2022-04-28 02:42:37,654 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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 104 states. [2022-04-28 02:42:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,655 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-28 02:42:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-28 02:42:37,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:37,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 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-28 02:42:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-04-28 02:42:37,656 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 95 [2022-04-28 02:42:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:37,656 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-04-28 02:42:37,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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-28 02:42:37,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 102 transitions. [2022-04-28 02:42:37,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-28 02:42:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 02:42:37,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:37,729 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:37,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:37,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:37,930 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 35 times [2022-04-28 02:42:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:37,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [451095107] [2022-04-28 02:42:37,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:37,941 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:37,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 36 times [2022-04-28 02:42:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777105270] [2022-04-28 02:42:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:38,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {13897#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {13873#true} is VALID [2022-04-28 02:42:38,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {13873#true} assume true; {13873#true} is VALID [2022-04-28 02:42:38,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13873#true} {13873#true} #43#return; {13873#true} is VALID [2022-04-28 02:42:38,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {13873#true} call ULTIMATE.init(); {13897#(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-28 02:42:38,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {13897#(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(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {13873#true} is VALID [2022-04-28 02:42:38,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {13873#true} assume true; {13873#true} is VALID [2022-04-28 02:42:38,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13873#true} {13873#true} #43#return; {13873#true} is VALID [2022-04-28 02:42:38,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {13873#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {13873#true} is VALID [2022-04-28 02:42:38,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {13873#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {13878#(= main_~i~0 0)} is VALID [2022-04-28 02:42:38,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {13878#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13878#(= main_~i~0 0)} is VALID [2022-04-28 02:42:38,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {13878#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:38,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:38,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:38,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 02:42:38,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:38,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 02:42:38,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:38,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 02:42:38,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:38,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 02:42:38,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:38,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 02:42:38,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:38,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 02:42:38,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:38,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 02:42:38,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:38,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 02:42:38,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:38,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 02:42:38,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:38,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 02:42:38,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:38,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 02:42:38,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:38,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 02:42:38,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:38,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 02:42:38,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:38,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-28 02:42:38,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:38,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-28 02:42:38,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-28 02:42:38,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-28 02:42:38,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13896#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {13896#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {13874#false} ~i~0 := 0; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 95: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 96: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 98: Hoare triple {13874#false} assume !(~i~0 % 4294967296 < 102400); {13874#false} is VALID [2022-04-28 02:42:38,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {13874#false} assume !false; {13874#false} is VALID [2022-04-28 02:42:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-04-28 02:42:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777105270] [2022-04-28 02:42:38,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777105270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647148671] [2022-04-28 02:42:38,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:42:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:38,340 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-28 02:42:38,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process